./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/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 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/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.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 16:17:39,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 16:17:39,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 16:17:39,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 16:17:39,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 16:17:39,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 16:17:39,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 16:17:39,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 16:17:39,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 16:17:39,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 16:17:39,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 16:17:39,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 16:17:39,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 16:17:39,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 16:17:39,375 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 16:17:39,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 16:17:39,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 16:17:39,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 16:17:39,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 16:17:39,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 16:17:39,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 16:17:39,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 16:17:39,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 16:17:39,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 16:17:39,379 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 16:17:39,379 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 16:17:39,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 16:17:39,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 16:17:39,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 16:17:39,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 16:17:39,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 16:17:39,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 16:17:39,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 16:17:39,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 16:17:39,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 16:17:39,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 16:17:39,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 16:17:39,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 16:17:39,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 16:17:39,382 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-10-14 16:17:39,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 16:17:39,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 16:17:39,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 16:17:39,581 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 16:17:39,581 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 16:17:39,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2024-10-14 16:17:40,776 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 16:17:41,183 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 16:17:41,184 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 [2024-10-14 16:17:41,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6498f368/bcf2bb4d782441baac8fd6b6a5480cfd/FLAGbdc2a5d55 [2024-10-14 16:17:41,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6498f368/bcf2bb4d782441baac8fd6b6a5480cfd [2024-10-14 16:17:41,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 16:17:41,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 16:17:41,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 16:17:41,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 16:17:41,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 16:17:41,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:17:41" (1/1) ... [2024-10-14 16:17:41,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392ece3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:17:41, skipping insertion in model container [2024-10-14 16:17:41,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:17:41" (1/1) ... [2024-10-14 16:17:41,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 16:17:43,602 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,605 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,605 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,609 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,609 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,610 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,610 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,610 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,610 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,610 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,611 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,611 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,611 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,611 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,611 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,612 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,612 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,613 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,613 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,614 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,614 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,614 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,615 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,615 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,615 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,615 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,616 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,616 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,616 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,617 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,617 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,617 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,618 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,618 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,618 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,619 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,619 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,619 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,620 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,620 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,620 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,620 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,621 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,621 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,622 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,622 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,622 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,623 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,623 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,624 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,624 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,624 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,624 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,624 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,625 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,625 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,626 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,626 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,627 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,627 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,628 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,628 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,628 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,629 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,629 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,629 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,629 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,629 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,630 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,630 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,631 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,631 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,631 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,632 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,632 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,632 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,632 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,633 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,633 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,633 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,633 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,633 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,634 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,634 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,635 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,635 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,635 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,635 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 16:17:43,675 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 16:17:43,791 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] [2024-10-14 16:17:43,793 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] [2024-10-14 16:17:43,793 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] [2024-10-14 16:17:43,794 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] [2024-10-14 16:17:43,811 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] [2024-10-14 16:17:43,812 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] [2024-10-14 16:17:43,812 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] [2024-10-14 16:17:43,834 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] [2024-10-14 16:17:43,899 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,900 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,900 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,902 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,903 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,903 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,903 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,904 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,904 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,904 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,905 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,905 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,905 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,906 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,906 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,907 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,907 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,907 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,907 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,908 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,908 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,909 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,909 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,909 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,909 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,910 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,910 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,910 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,910 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,911 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,911 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,912 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,913 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,913 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,914 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,914 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,914 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,914 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,914 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,914 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,915 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,915 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,915 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,915 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,915 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,916 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,916 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,916 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,917 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,917 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,918 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,918 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,918 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,918 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,918 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,919 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,919 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,919 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,920 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,920 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,920 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,920 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,921 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,921 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,922 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,922 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,922 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,922 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,924 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,924 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,924 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,925 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,925 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,925 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,925 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,925 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,925 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,926 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,926 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,926 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,927 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,927 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,928 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,928 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,928 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,928 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,928 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,929 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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] [2024-10-14 16:17:43,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 16:17:44,116 INFO L204 MainTranslator]: Completed translation [2024-10-14 16:17:44,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:17:44 WrapperNode [2024-10-14 16:17:44,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 16:17:44,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 16:17:44,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 16:17:44,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 16:17:44,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:17:44" (1/1) ... [2024-10-14 16:17:44,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:17:44" (1/1) ... [2024-10-14 16:17:44,277 INFO L138 Inliner]: procedures = 616, calls = 1464, calls flagged for inlining = 275, calls inlined = 180, statements flattened = 2741 [2024-10-14 16:17:44,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 16:17:44,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 16:17:44,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 16:17:44,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 16:17:44,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:17:44" (1/1) ... [2024-10-14 16:17:44,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:17:44" (1/1) ... [2024-10-14 16:17:44,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:17:44" (1/1) ... [2024-10-14 16:17:44,579 INFO L175 MemorySlicer]: Split 243 memory accesses to 24 slices as follows [14, 8, 6, 1, 4, 30, 7, 10, 3, 1, 1, 1, 3, 2, 102, 1, 4, 12, 1, 2, 4, 4, 18, 4]. 42 percent of accesses are in the largest equivalence class. The 108 initializations are split as follows [14, 0, 6, 0, 4, 30, 7, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 0, 1, 2, 0, 4, 18, 4]. The 35 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 32, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-14 16:17:44,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:17:44" (1/1) ... [2024-10-14 16:17:44,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:17:44" (1/1) ... [2024-10-14 16:17:44,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:17:44" (1/1) ... [2024-10-14 16:17:44,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:17:44" (1/1) ... [2024-10-14 16:17:44,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:17:44" (1/1) ... [2024-10-14 16:17:44,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:17:44" (1/1) ... [2024-10-14 16:17:44,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 16:17:44,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 16:17:44,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 16:17:44,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 16:17:44,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:17:44" (1/1) ... [2024-10-14 16:17:44,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 16:17:44,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:17:44,749 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) [2024-10-14 16:17:44,753 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 [2024-10-14 16:17:44,789 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_total_size [2024-10-14 16:17:44,790 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_total_size [2024-10-14 16:17:44,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2024-10-14 16:17:44,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2024-10-14 16:17:44,790 INFO L130 BoogieDeclarations]: Found specification of procedure seq_release_net [2024-10-14 16:17:44,790 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_release_net [2024-10-14 16:17:44,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-14 16:17:44,790 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-14 16:17:44,790 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2024-10-14 16:17:44,790 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2024-10-14 16:17:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-14 16:17:44,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-14 16:17:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2024-10-14 16:17:44,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2024-10-14 16:17:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2024-10-14 16:17:44,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2024-10-14 16:17:44,792 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_send [2024-10-14 16:17:44,792 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_send [2024-10-14 16:17:44,792 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh [2024-10-14 16:17:44,792 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh [2024-10-14 16:17:44,792 INFO L130 BoogieDeclarations]: Found specification of procedure instance_put [2024-10-14 16:17:44,792 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_put [2024-10-14 16:17:44,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2024-10-14 16:17:44,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2024-10-14 16:17:44,792 INFO L130 BoogieDeclarations]: Found specification of procedure nf_log_unregister [2024-10-14 16:17:44,792 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_log_unregister [2024-10-14 16:17:44,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2024-10-14 16:17:44,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2024-10-14 16:17:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2024-10-14 16:17:44,793 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2024-10-14 16:17:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2024-10-14 16:17:44,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2024-10-14 16:17:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2024-10-14 16:17:44,793 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2024-10-14 16:17:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-10-14 16:17:44,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-10-14 16:17:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2024-10-14 16:17:44,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2024-10-14 16:17:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 16:17:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tailroom [2024-10-14 16:17:44,794 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tailroom [2024-10-14 16:17:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2024-10-14 16:17:44,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2024-10-14 16:17:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2024-10-14 16:17:44,794 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2024-10-14 16:17:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2024-10-14 16:17:44,794 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2024-10-14 16:17:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2024-10-14 16:17:44,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2024-10-14 16:17:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2024-10-14 16:17:44,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2024-10-14 16:17:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure nfnetlink_subsys_unregister [2024-10-14 16:17:44,795 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnetlink_subsys_unregister [2024-10-14 16:17:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2024-10-14 16:17:44,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2024-10-14 16:17:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 16:17:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 16:17:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 16:17:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 16:17:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 16:17:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 16:17:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-14 16:17:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-14 16:17:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-14 16:17:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-14 16:17:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-14 16:17:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-14 16:17:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-14 16:17:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-14 16:17:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-14 16:17:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-14 16:17:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-10-14 16:17:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-10-14 16:17:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2024-10-14 16:17:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2024-10-14 16:17:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2024-10-14 16:17:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2024-10-14 16:17:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2024-10-14 16:17:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2024-10-14 16:17:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2024-10-14 16:17:44,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2024-10-14 16:17:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2024-10-14 16:17:44,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2024-10-14 16:17:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure seq_file_net [2024-10-14 16:17:44,797 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_file_net [2024-10-14 16:17:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_130 [2024-10-14 16:17:44,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_130 [2024-10-14 16:17:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2024-10-14 16:17:44,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2024-10-14 16:17:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_put [2024-10-14 16:17:44,797 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_put [2024-10-14 16:17:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_138 [2024-10-14 16:17:44,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_138 [2024-10-14 16:17:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2024-10-14 16:17:44,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure instance_lookup_get [2024-10-14 16:17:44,798 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_lookup_get [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2024-10-14 16:17:44,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2024-10-14 16:17:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2024-10-14 16:17:44,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2024-10-14 16:17:44,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2024-10-14 16:17:44,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2024-10-14 16:17:44,799 INFO L130 BoogieDeclarations]: Found specification of procedure seq_show [2024-10-14 16:17:44,799 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_show [2024-10-14 16:17:44,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2024-10-14 16:17:44,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2024-10-14 16:17:44,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 16:17:44,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 16:17:44,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2024-10-14 16:17:44,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2024-10-14 16:17:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2024-10-14 16:17:44,802 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2024-10-14 16:17:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2024-10-14 16:17:44,802 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2024-10-14 16:17:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-14 16:17:44,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-14 16:17:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2024-10-14 16:17:44,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2024-10-14 16:17:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure nful_open [2024-10-14 16:17:44,802 INFO L138 BoogieDeclarations]: Found implementation of procedure nful_open [2024-10-14 16:17:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure seq_read [2024-10-14 16:17:44,802 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_read [2024-10-14 16:17:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netlink_unregister_notifier [2024-10-14 16:17:44,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netlink_unregister_notifier [2024-10-14 16:17:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure nla_get_be32 [2024-10-14 16:17:44,803 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_get_be32 [2024-10-14 16:17:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2024-10-14 16:17:44,803 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2024-10-14 16:17:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_pernet [2024-10-14 16:17:44,803 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_pernet [2024-10-14 16:17:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2024-10-14 16:17:44,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2024-10-14 16:17:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_for_read_section [2024-10-14 16:17:44,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_for_read_section [2024-10-14 16:17:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_data [2024-10-14 16:17:44,803 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_data [2024-10-14 16:17:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2024-10-14 16:17:44,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2024-10-14 16:17:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 16:17:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2024-10-14 16:17:44,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2024-10-14 16:17:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 16:17:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 16:17:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 16:17:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-14 16:17:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-14 16:17:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-14 16:17:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-14 16:17:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-14 16:17:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-14 16:17:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-14 16:17:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-14 16:17:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-14 16:17:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-14 16:17:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-14 16:17:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-10-14 16:17:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-10-14 16:17:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-10-14 16:17:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2024-10-14 16:17:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2024-10-14 16:17:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2024-10-14 16:17:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2024-10-14 16:17:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2024-10-14 16:17:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2024-10-14 16:17:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2024-10-14 16:17:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_unlock_bh [2024-10-14 16:17:44,806 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_unlock_bh [2024-10-14 16:17:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 16:17:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 16:17:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 16:17:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-14 16:17:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-14 16:17:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-14 16:17:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-14 16:17:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-14 16:17:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-14 16:17:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-14 16:17:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-14 16:17:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-14 16:17:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-14 16:17:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-14 16:17:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-10-14 16:17:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-10-14 16:17:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-10-14 16:17:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2024-10-14 16:17:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2024-10-14 16:17:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2024-10-14 16:17:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2024-10-14 16:17:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2024-10-14 16:17:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2024-10-14 16:17:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2024-10-14 16:17:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-10-14 16:17:44,808 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-10-14 16:17:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_net_exit [2024-10-14 16:17:44,808 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_net_exit [2024-10-14 16:17:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure nla_data [2024-10-14 16:17:44,808 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_data [2024-10-14 16:17:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2024-10-14 16:17:44,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2024-10-14 16:17:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2024-10-14 16:17:44,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2024-10-14 16:17:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_lookup [2024-10-14 16:17:44,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_lookup [2024-10-14 16:17:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2024-10-14 16:17:44,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2024-10-14 16:17:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-14 16:17:44,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-14 16:17:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2024-10-14 16:17:44,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2024-10-14 16:17:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2024-10-14 16:17:44,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2024-10-14 16:17:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_132 [2024-10-14 16:17:44,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_132 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_139 [2024-10-14 16:17:44,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_139 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_unregister_notifier [2024-10-14 16:17:44,809 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_unregister_notifier [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2024-10-14 16:17:44,809 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2024-10-14 16:17:44,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-14 16:17:44,809 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-14 16:17:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-10-14 16:17:44,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-10-14 16:17:44,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2024-10-14 16:17:44,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2024-10-14 16:17:44,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2024-10-14 16:17:44,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2024-10-14 16:17:44,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2024-10-14 16:17:44,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2024-10-14 16:17:44,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2024-10-14 16:17:44,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2024-10-14 16:17:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-14 16:17:44,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-14 16:17:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2024-10-14 16:17:44,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2024-10-14 16:17:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2024-10-14 16:17:44,811 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2024-10-14 16:17:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_rcu_suspicious [2024-10-14 16:17:44,811 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_rcu_suspicious [2024-10-14 16:17:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh_held [2024-10-14 16:17:44,811 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh_held [2024-10-14 16:17:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_destroy [2024-10-14 16:17:44,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_destroy [2024-10-14 16:17:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2024-10-14 16:17:44,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2024-10-14 16:17:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2024-10-14 16:17:44,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2024-10-14 16:17:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2024-10-14 16:17:44,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2024-10-14 16:17:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure instance_hashfn [2024-10-14 16:17:44,812 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_hashfn [2024-10-14 16:17:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 16:17:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 16:17:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 16:17:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 16:17:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 16:17:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 16:17:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 16:17:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 16:17:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 16:17:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 16:17:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 16:17:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 16:17:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 16:17:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 16:17:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-14 16:17:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-14 16:17:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-14 16:17:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-14 16:17:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-14 16:17:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-14 16:17:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2024-10-14 16:17:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2024-10-14 16:17:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2024-10-14 16:17:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2024-10-14 16:17:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_flush [2024-10-14 16:17:44,814 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_flush [2024-10-14 16:17:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure get_next [2024-10-14 16:17:44,814 INFO L138 BoogieDeclarations]: Found implementation of procedure get_next [2024-10-14 16:17:45,287 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 16:17:45,290 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 16:17:45,340 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-14 16:17:46,757 INFO L? ?]: Removed 1564 outVars from TransFormulas that were not future-live. [2024-10-14 16:17:46,757 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 16:17:46,928 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 16:17:46,928 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 16:17:46,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:17:46 BoogieIcfgContainer [2024-10-14 16:17:46,928 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 16:17:46,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 16:17:46,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 16:17:46,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 16:17:46,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:17:41" (1/3) ... [2024-10-14 16:17:46,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@306a3ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:17:46, skipping insertion in model container [2024-10-14 16:17:46,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:17:44" (2/3) ... [2024-10-14 16:17:46,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@306a3ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:17:46, skipping insertion in model container [2024-10-14 16:17:46,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:17:46" (3/3) ... [2024-10-14 16:17:46,939 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2024-10-14 16:17:46,952 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 16:17:46,953 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2024-10-14 16:17:47,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 16:17:47,037 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;@47057af6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 16:17:47,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2024-10-14 16:17:47,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 916 states, 536 states have (on average 1.3488805970149254) internal successors, (723), 589 states have internal predecessors, (723), 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) [2024-10-14 16:17:47,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 16:17:47,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:17:47,059 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-14 16:17:47,059 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)] === [2024-10-14 16:17:47,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:17:47,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1449371498, now seen corresponding path program 1 times [2024-10-14 16:17:47,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:17:47,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940094079] [2024-10-14 16:17:47,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:17:47,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:17:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:47,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:17:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:47,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:17:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:47,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:17:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:47,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 16:17:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:47,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 16:17:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:47,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 16:17:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:47,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:17:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:47,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 16:17:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:47,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 16:17:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 16:17:47,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:17:47,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940094079] [2024-10-14 16:17:47,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940094079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:17:47,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:17:47,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:17:47,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512369008] [2024-10-14 16:17:47,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:17:47,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:17:47,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:17:47,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:17:47,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:17:47,674 INFO L87 Difference]: Start difference. First operand has 916 states, 536 states have (on average 1.3488805970149254) internal successors, (723), 589 states have internal predecessors, (723), 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 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 16:17:49,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:17:49,799 INFO L93 Difference]: Finished difference Result 1809 states and 2545 transitions. [2024-10-14 16:17:49,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:17:49,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (10), 4 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 51 [2024-10-14 16:17:49,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:17:49,817 INFO L225 Difference]: With dead ends: 1809 [2024-10-14 16:17:49,817 INFO L226 Difference]: Without dead ends: 898 [2024-10-14 16:17:49,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:17:49,825 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 1573 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 2641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 16:17:49,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1751 Valid, 1576 Invalid, 2641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 1829 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 16:17:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-10-14 16:17:49,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 898. [2024-10-14 16:17:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 527 states have (on average 1.2675521821631879) internal successors, (668), 574 states have internal predecessors, (668), 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) [2024-10-14 16:17:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1182 transitions. [2024-10-14 16:17:49,922 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1182 transitions. Word has length 51 [2024-10-14 16:17:49,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:17:49,923 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1182 transitions. [2024-10-14 16:17:49,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 16:17:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1182 transitions. [2024-10-14 16:17:49,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 16:17:49,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:17:49,926 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-14 16:17:49,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 16:17:49,926 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)] === [2024-10-14 16:17:49,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:17:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash 8981866, now seen corresponding path program 1 times [2024-10-14 16:17:49,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:17:49,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258268208] [2024-10-14 16:17:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:17:49,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:17:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:50,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:17:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:50,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:17:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:50,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:17:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:50,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 16:17:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:50,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 16:17:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:50,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 16:17:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:50,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:17:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:50,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 16:17:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:50,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 16:17:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:50,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 16:17:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 16:17:50,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:17:50,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258268208] [2024-10-14 16:17:50,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258268208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:17:50,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:17:50,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:17:50,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758017179] [2024-10-14 16:17:50,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:17:50,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:17:50,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:17:50,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:17:50,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:17:50,189 INFO L87 Difference]: Start difference. First operand 898 states and 1182 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 16:17:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:17:51,921 INFO L93 Difference]: Finished difference Result 898 states and 1182 transitions. [2024-10-14 16:17:51,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:17:51,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (11), 4 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 56 [2024-10-14 16:17:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:17:51,926 INFO L225 Difference]: With dead ends: 898 [2024-10-14 16:17:51,926 INFO L226 Difference]: Without dead ends: 896 [2024-10-14 16:17:51,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:17:51,928 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1542 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 16:17:51,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1717 Valid, 1544 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 16:17:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-10-14 16:17:51,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2024-10-14 16:17:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 526 states have (on average 1.2661596958174905) internal successors, (666), 572 states have internal predecessors, (666), 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) [2024-10-14 16:17:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1180 transitions. [2024-10-14 16:17:51,967 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1180 transitions. Word has length 56 [2024-10-14 16:17:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:17:51,967 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1180 transitions. [2024-10-14 16:17:51,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 16:17:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1180 transitions. [2024-10-14 16:17:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 16:17:51,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:17:51,969 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-14 16:17:51,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 16:17:51,970 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)] === [2024-10-14 16:17:51,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:17:51,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1833202606, now seen corresponding path program 1 times [2024-10-14 16:17:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:17:51,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207917287] [2024-10-14 16:17:51,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:17:51,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:17:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:52,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:17:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:52,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:17:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:52,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:17:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:52,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 16:17:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:52,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 16:17:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:52,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 16:17:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:52,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:17:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:52,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 16:17:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:52,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 16:17:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:52,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 16:17:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:52,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 16:17:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 16:17:52,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:17:52,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207917287] [2024-10-14 16:17:52,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207917287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:17:52,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:17:52,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:17:52,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271077501] [2024-10-14 16:17:52,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:17:52,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:17:52,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:17:52,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:17:52,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:17:52,240 INFO L87 Difference]: Start difference. First operand 896 states and 1180 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 16:17:53,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:17:53,993 INFO L93 Difference]: Finished difference Result 896 states and 1180 transitions. [2024-10-14 16:17:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:17:53,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (12), 4 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 61 [2024-10-14 16:17:53,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:17:53,997 INFO L225 Difference]: With dead ends: 896 [2024-10-14 16:17:53,997 INFO L226 Difference]: Without dead ends: 894 [2024-10-14 16:17:53,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:17:53,998 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1536 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1710 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 16:17:53,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1710 Valid, 1544 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 16:17:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-10-14 16:17:54,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2024-10-14 16:17:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 525 states have (on average 1.2647619047619048) internal successors, (664), 570 states have internal predecessors, (664), 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) [2024-10-14 16:17:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1178 transitions. [2024-10-14 16:17:54,036 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1178 transitions. Word has length 61 [2024-10-14 16:17:54,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:17:54,037 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1178 transitions. [2024-10-14 16:17:54,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 16:17:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1178 transitions. [2024-10-14 16:17:54,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 16:17:54,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:17:54,041 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-14 16:17:54,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 16:17:54,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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)] === [2024-10-14 16:17:54,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:17:54,043 INFO L85 PathProgramCache]: Analyzing trace with hash 996372127, now seen corresponding path program 1 times [2024-10-14 16:17:54,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:17:54,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027684526] [2024-10-14 16:17:54,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:17:54,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:17:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:54,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:17:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:54,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:17:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:54,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:17:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:54,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 16:17:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:54,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 16:17:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:54,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 16:17:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:54,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:17:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:54,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 16:17:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:54,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 16:17:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:54,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 16:17:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:54,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 16:17:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 16:17:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 16:17:54,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:17:54,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027684526] [2024-10-14 16:17:54,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027684526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:17:54,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:17:54,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:17:54,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231037995] [2024-10-14 16:17:54,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:17:54,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:17:54,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:17:54,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:17:54,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:17:54,338 INFO L87 Difference]: Start difference. First operand 894 states and 1178 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 16:17:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:17:55,893 INFO L93 Difference]: Finished difference Result 894 states and 1178 transitions. [2024-10-14 16:17:55,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:17:55,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (13), 4 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 66 [2024-10-14 16:17:55,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:17:55,897 INFO L225 Difference]: With dead ends: 894 [2024-10-14 16:17:55,897 INFO L226 Difference]: Without dead ends: 892 [2024-10-14 16:17:55,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:17:55,898 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1530 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:17:55,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 1544 Invalid, 2603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 16:17:55,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2024-10-14 16:17:55,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2024-10-14 16:17:55,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 524 states have (on average 1.2633587786259541) internal successors, (662), 568 states have internal predecessors, (662), 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) [2024-10-14 16:17:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1176 transitions. [2024-10-14 16:17:55,933 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1176 transitions. Word has length 66 [2024-10-14 16:17:55,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:17:55,933 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1176 transitions. [2024-10-14 16:17:55,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 16:17:55,934 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1176 transitions. [2024-10-14 16:17:55,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 16:17:55,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:17:55,939 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 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] [2024-10-14 16:17:55,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 16:17:55,939 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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)] === [2024-10-14 16:17:55,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:17:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash -635645305, now seen corresponding path program 1 times [2024-10-14 16:17:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:17:55,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383116525] [2024-10-14 16:17:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:17:55,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:17:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:56,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:17:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:56,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:17:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:56,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:17:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:56,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 16:17:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:56,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:17:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:56,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:17:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:56,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:17:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:56,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 16:17:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:56,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 16:17:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:56,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:17:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:56,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:17:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:56,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:17:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:56,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 16:17:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:56,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 16:17:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:56,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 16:17:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-14 16:17:56,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:17:56,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383116525] [2024-10-14 16:17:56,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383116525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:17:56,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:17:56,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:17:56,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088039680] [2024-10-14 16:17:56,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:17:56,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:17:56,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:17:56,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:17:56,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:17:56,306 INFO L87 Difference]: Start difference. First operand 892 states and 1176 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 16:17:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:17:58,682 INFO L93 Difference]: Finished difference Result 1529 states and 1980 transitions. [2024-10-14 16:17:58,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:17:58,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (13), 3 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 77 [2024-10-14 16:17:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:17:58,692 INFO L225 Difference]: With dead ends: 1529 [2024-10-14 16:17:58,693 INFO L226 Difference]: Without dead ends: 1527 [2024-10-14 16:17:58,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:17:58,695 INFO L432 NwaCegarLoop]: 748 mSDtfsCounter, 1127 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 3496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 16:17:58,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 2595 Invalid, 3496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 16:17:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2024-10-14 16:17:58,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1300. [2024-10-14 16:17:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 756 states have (on average 1.2526455026455026) internal successors, (947), 814 states have internal predecessors, (947), 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) [2024-10-14 16:17:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1717 transitions. [2024-10-14 16:17:58,819 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1717 transitions. Word has length 77 [2024-10-14 16:17:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:17:58,821 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1717 transitions. [2024-10-14 16:17:58,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 16:17:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1717 transitions. [2024-10-14 16:17:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:17:58,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:17:58,823 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-14 16:17:58,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 16:17:58,824 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)] === [2024-10-14 16:17:58,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:17:58,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1198657637, now seen corresponding path program 1 times [2024-10-14 16:17:58,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:17:58,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259120350] [2024-10-14 16:17:58,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:17:58,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:17:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:58,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:17:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:58,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:17:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:58,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:17:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:58,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 16:17:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:58,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 16:17:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:58,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 16:17:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:58,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:17:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:58,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 16:17:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:58,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 16:17:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:59,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 16:17:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:59,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 16:17:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:59,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 16:17:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:59,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 16:17:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:17:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 16:17:59,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:17:59,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259120350] [2024-10-14 16:17:59,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259120350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:17:59,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:17:59,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:17:59,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224070003] [2024-10-14 16:17:59,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:17:59,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:17:59,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:17:59,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:17:59,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:17:59,031 INFO L87 Difference]: Start difference. First operand 1300 states and 1717 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 16:18:00,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:00,648 INFO L93 Difference]: Finished difference Result 1300 states and 1717 transitions. [2024-10-14 16:18:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:18:00,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (14), 4 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 71 [2024-10-14 16:18:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:00,654 INFO L225 Difference]: With dead ends: 1300 [2024-10-14 16:18:00,654 INFO L226 Difference]: Without dead ends: 1298 [2024-10-14 16:18:00,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:18:00,656 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1524 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:00,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1696 Valid, 1544 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 16:18:00,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2024-10-14 16:18:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2024-10-14 16:18:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 755 states have (on average 1.2516556291390728) internal successors, (945), 812 states have internal predecessors, (945), 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) [2024-10-14 16:18:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1715 transitions. [2024-10-14 16:18:00,767 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1715 transitions. Word has length 71 [2024-10-14 16:18:00,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:00,767 INFO L471 AbstractCegarLoop]: Abstraction has 1298 states and 1715 transitions. [2024-10-14 16:18:00,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 16:18:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1715 transitions. [2024-10-14 16:18:00,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 16:18:00,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:00,769 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-14 16:18:00,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 16:18:00,769 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)] === [2024-10-14 16:18:00,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:00,770 INFO L85 PathProgramCache]: Analyzing trace with hash -255155898, now seen corresponding path program 1 times [2024-10-14 16:18:00,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:00,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445722659] [2024-10-14 16:18:00,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:00,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:00,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:00,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:00,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:00,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 16:18:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:00,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 16:18:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:00,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 16:18:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:00,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:00,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 16:18:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:00,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 16:18:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:00,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 16:18:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:00,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 16:18:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:00,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 16:18:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:00,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 16:18:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:00,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 16:18:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:00,993 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 16:18:00,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:00,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445722659] [2024-10-14 16:18:00,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445722659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:00,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:00,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:18:00,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974653777] [2024-10-14 16:18:00,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:00,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:18:00,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:00,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:18:00,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:18:00,997 INFO L87 Difference]: Start difference. First operand 1298 states and 1715 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 16:18:02,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:02,686 INFO L93 Difference]: Finished difference Result 1298 states and 1715 transitions. [2024-10-14 16:18:02,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:18:02,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (15), 4 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 76 [2024-10-14 16:18:02,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:02,691 INFO L225 Difference]: With dead ends: 1298 [2024-10-14 16:18:02,691 INFO L226 Difference]: Without dead ends: 1296 [2024-10-14 16:18:02,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:18:02,692 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1518 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:02,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 1544 Invalid, 2595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1793 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 16:18:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2024-10-14 16:18:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2024-10-14 16:18:02,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 754 states have (on average 1.2506631299734747) internal successors, (943), 810 states have internal predecessors, (943), 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) [2024-10-14 16:18:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1713 transitions. [2024-10-14 16:18:02,758 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1713 transitions. Word has length 76 [2024-10-14 16:18:02,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:02,759 INFO L471 AbstractCegarLoop]: Abstraction has 1296 states and 1713 transitions. [2024-10-14 16:18:02,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 16:18:02,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1713 transitions. [2024-10-14 16:18:02,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 16:18:02,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:02,761 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-14 16:18:02,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 16:18:02,761 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2024-10-14 16:18:02,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:02,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1448992038, now seen corresponding path program 1 times [2024-10-14 16:18:02,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:02,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239232482] [2024-10-14 16:18:02,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:02,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:02,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:02,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:02,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:02,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 16:18:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:02,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 16:18:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:02,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 16:18:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:02,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:02,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 16:18:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:02,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 16:18:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:02,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 16:18:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:02,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 16:18:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:02,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 16:18:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:02,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 16:18:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:02,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 16:18:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:02,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 16:18:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 16:18:02,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:02,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239232482] [2024-10-14 16:18:02,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239232482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:02,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:02,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:18:02,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007606783] [2024-10-14 16:18:02,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:02,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:18:02,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:02,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:18:02,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:18:02,988 INFO L87 Difference]: Start difference. First operand 1296 states and 1713 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 16:18:04,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:04,623 INFO L93 Difference]: Finished difference Result 1296 states and 1713 transitions. [2024-10-14 16:18:04,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:18:04,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (16), 4 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 81 [2024-10-14 16:18:04,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:04,629 INFO L225 Difference]: With dead ends: 1296 [2024-10-14 16:18:04,629 INFO L226 Difference]: Without dead ends: 1294 [2024-10-14 16:18:04,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:18:04,629 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1512 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1682 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:04,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1682 Valid, 1544 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1789 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 16:18:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2024-10-14 16:18:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2024-10-14 16:18:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 753 states have (on average 1.249667994687915) internal successors, (941), 808 states have internal predecessors, (941), 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) [2024-10-14 16:18:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1711 transitions. [2024-10-14 16:18:04,696 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1711 transitions. Word has length 81 [2024-10-14 16:18:04,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:04,697 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1711 transitions. [2024-10-14 16:18:04,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 16:18:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1711 transitions. [2024-10-14 16:18:04,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 16:18:04,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:04,698 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-14 16:18:04,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 16:18:04,699 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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)] === [2024-10-14 16:18:04,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:04,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1681545230, now seen corresponding path program 1 times [2024-10-14 16:18:04,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:04,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736449249] [2024-10-14 16:18:04,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:04,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:04,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:04,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:04,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:04,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 16:18:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:04,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 16:18:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:04,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 16:18:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:04,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:04,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 16:18:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:04,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 16:18:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:04,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 16:18:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:04,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 16:18:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:04,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 16:18:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:04,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 16:18:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:04,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 16:18:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:04,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 16:18:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:04,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 16:18:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 16:18:04,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:04,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736449249] [2024-10-14 16:18:04,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736449249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:04,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:04,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:18:04,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640080950] [2024-10-14 16:18:04,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:04,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:18:04,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:04,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:18:04,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:18:04,905 INFO L87 Difference]: Start difference. First operand 1294 states and 1711 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 16:18:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:06,353 INFO L93 Difference]: Finished difference Result 1294 states and 1711 transitions. [2024-10-14 16:18:06,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:18:06,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (17), 4 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 86 [2024-10-14 16:18:06,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:06,358 INFO L225 Difference]: With dead ends: 1294 [2024-10-14 16:18:06,358 INFO L226 Difference]: Without dead ends: 1292 [2024-10-14 16:18:06,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:18:06,359 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1506 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:06,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 1544 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 16:18:06,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2024-10-14 16:18:06,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2024-10-14 16:18:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 752 states have (on average 1.2486702127659575) internal successors, (939), 806 states have internal predecessors, (939), 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) [2024-10-14 16:18:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1709 transitions. [2024-10-14 16:18:06,434 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1709 transitions. Word has length 86 [2024-10-14 16:18:06,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:06,434 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1709 transitions. [2024-10-14 16:18:06,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 16:18:06,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1709 transitions. [2024-10-14 16:18:06,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 16:18:06,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:06,436 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 3, 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] [2024-10-14 16:18:06,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 16:18:06,436 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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)] === [2024-10-14 16:18:06,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1548066210, now seen corresponding path program 1 times [2024-10-14 16:18:06,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:06,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602813295] [2024-10-14 16:18:06,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:06,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 16:18:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 16:18:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 16:18:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 16:18:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 16:18:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 16:18:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 16:18:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-14 16:18:06,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:06,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602813295] [2024-10-14 16:18:06,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602813295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:06,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:06,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 16:18:06,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255602265] [2024-10-14 16:18:06,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:06,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 16:18:06,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:06,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 16:18:06,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:18:06,696 INFO L87 Difference]: Start difference. First operand 1292 states and 1709 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 16:18:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:09,228 INFO L93 Difference]: Finished difference Result 1527 states and 1997 transitions. [2024-10-14 16:18:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:18:09,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (16), 5 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 93 [2024-10-14 16:18:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:09,234 INFO L225 Difference]: With dead ends: 1527 [2024-10-14 16:18:09,234 INFO L226 Difference]: Without dead ends: 1525 [2024-10-14 16:18:09,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-14 16:18:09,235 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1514 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 3261 mSolverCounterSat, 790 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 4051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 790 IncrementalHoareTripleChecker+Valid, 3261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:09,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 2032 Invalid, 4051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [790 Valid, 3261 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 16:18:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2024-10-14 16:18:09,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1433. [2024-10-14 16:18:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 843 states have (on average 1.2514827995255042) internal successors, (1055), 898 states have internal predecessors, (1055), 410 states have call successors, (410), 158 states have call predecessors, (410), 157 states have return successors, (412), 395 states have call predecessors, (412), 408 states have call successors, (412) [2024-10-14 16:18:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1877 transitions. [2024-10-14 16:18:09,323 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1877 transitions. Word has length 93 [2024-10-14 16:18:09,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:09,323 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 1877 transitions. [2024-10-14 16:18:09,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 16:18:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1877 transitions. [2024-10-14 16:18:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 16:18:09,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:09,325 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-14 16:18:09,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 16:18:09,325 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2024-10-14 16:18:09,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:09,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1057117867, now seen corresponding path program 1 times [2024-10-14 16:18:09,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:09,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045422604] [2024-10-14 16:18:09,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:09,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:09,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:09,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:09,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:09,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 16:18:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:09,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 16:18:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:09,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 16:18:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:09,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:09,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 16:18:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:09,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 16:18:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:09,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 16:18:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:09,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 16:18:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:09,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 16:18:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:09,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 16:18:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:09,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 16:18:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:09,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 16:18:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:09,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 16:18:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 16:18:09,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:09,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045422604] [2024-10-14 16:18:09,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045422604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:09,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:09,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:18:09,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856315222] [2024-10-14 16:18:09,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:09,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:18:09,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:09,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:18:09,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:18:09,549 INFO L87 Difference]: Start difference. First operand 1433 states and 1877 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 16:18:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:10,873 INFO L93 Difference]: Finished difference Result 1433 states and 1877 transitions. [2024-10-14 16:18:10,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:18:10,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (17), 4 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 88 [2024-10-14 16:18:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:10,878 INFO L225 Difference]: With dead ends: 1433 [2024-10-14 16:18:10,879 INFO L226 Difference]: Without dead ends: 1431 [2024-10-14 16:18:10,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:18:10,879 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1498 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1667 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:10,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1667 Valid, 1544 Invalid, 2583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 16:18:10,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2024-10-14 16:18:10,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1431. [2024-10-14 16:18:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 842 states have (on average 1.2505938242280286) internal successors, (1053), 896 states have internal predecessors, (1053), 410 states have call successors, (410), 158 states have call predecessors, (410), 157 states have return successors, (412), 395 states have call predecessors, (412), 408 states have call successors, (412) [2024-10-14 16:18:10,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1875 transitions. [2024-10-14 16:18:10,976 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1875 transitions. Word has length 88 [2024-10-14 16:18:10,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:10,976 INFO L471 AbstractCegarLoop]: Abstraction has 1431 states and 1875 transitions. [2024-10-14 16:18:10,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 16:18:10,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1875 transitions. [2024-10-14 16:18:10,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 16:18:10,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:10,978 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 5, 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] [2024-10-14 16:18:10,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 16:18:10,978 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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)] === [2024-10-14 16:18:10,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:10,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1462592126, now seen corresponding path program 1 times [2024-10-14 16:18:10,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:10,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483614867] [2024-10-14 16:18:10,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:10,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 16:18:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 16:18:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 16:18:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 16:18:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 16:18:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 16:18:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 16:18:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 16:18:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 16:18:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 16:18:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 16:18:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-14 16:18:11,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:11,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483614867] [2024-10-14 16:18:11,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483614867] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 16:18:11,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639772756] [2024-10-14 16:18:11,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:11,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 16:18:11,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:18:11,302 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) [2024-10-14 16:18:11,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 16:18:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:11,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 16:18:11,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 16:18:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-14 16:18:11,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 16:18:11,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639772756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:11,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 16:18:11,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2024-10-14 16:18:11,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908801862] [2024-10-14 16:18:11,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:11,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 16:18:11,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:11,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 16:18:11,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:18:11,803 INFO L87 Difference]: Start difference. First operand 1431 states and 1875 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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) [2024-10-14 16:18:12,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:12,515 INFO L93 Difference]: Finished difference Result 2728 states and 3544 transitions. [2024-10-14 16:18:12,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 16:18:12,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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 103 [2024-10-14 16:18:12,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:12,523 INFO L225 Difference]: With dead ends: 2728 [2024-10-14 16:18:12,523 INFO L226 Difference]: Without dead ends: 1439 [2024-10-14 16:18:12,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:18:12,527 INFO L432 NwaCegarLoop]: 991 mSDtfsCounter, 31 mSDsluCounter, 2889 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3880 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:12,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3880 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 16:18:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2024-10-14 16:18:12,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1437. [2024-10-14 16:18:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 846 states have (on average 1.2494089834515367) internal successors, (1057), 900 states have internal predecessors, (1057), 412 states have call successors, (412), 158 states have call predecessors, (412), 157 states have return successors, (414), 397 states have call predecessors, (414), 410 states have call successors, (414) [2024-10-14 16:18:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1883 transitions. [2024-10-14 16:18:12,630 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1883 transitions. Word has length 103 [2024-10-14 16:18:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:12,630 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 1883 transitions. [2024-10-14 16:18:12,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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) [2024-10-14 16:18:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1883 transitions. [2024-10-14 16:18:12,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 16:18:12,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:12,631 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-14 16:18:12,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 16:18:12,832 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,SelfDestructingSolverStorable11 [2024-10-14 16:18:12,832 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)] === [2024-10-14 16:18:12,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1150653234, now seen corresponding path program 1 times [2024-10-14 16:18:12,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:12,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97822453] [2024-10-14 16:18:12,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:12,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:12,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:12,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:12,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:12,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 16:18:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:12,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 16:18:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:12,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 16:18:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:12,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:13,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 16:18:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:13,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 16:18:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:13,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 16:18:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:13,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 16:18:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:13,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 16:18:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:13,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 16:18:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:13,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 16:18:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:13,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 16:18:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:13,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 16:18:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:13,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 16:18:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 16:18:13,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:13,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97822453] [2024-10-14 16:18:13,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97822453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:13,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:13,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:18:13,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383937081] [2024-10-14 16:18:13,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:13,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:18:13,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:13,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:18:13,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:18:13,051 INFO L87 Difference]: Start difference. First operand 1437 states and 1883 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 16:18:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:15,365 INFO L93 Difference]: Finished difference Result 2170 states and 2779 transitions. [2024-10-14 16:18:15,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 16:18:15,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (18), 4 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 93 [2024-10-14 16:18:15,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:15,374 INFO L225 Difference]: With dead ends: 2170 [2024-10-14 16:18:15,374 INFO L226 Difference]: Without dead ends: 2168 [2024-10-14 16:18:15,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:18:15,375 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 2101 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 2353 mSolverCounterSat, 1204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2269 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 3557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1204 IncrementalHoareTripleChecker+Valid, 2353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:15,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2269 Valid, 1768 Invalid, 3557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1204 Valid, 2353 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 16:18:15,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2024-10-14 16:18:15,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2123. [2024-10-14 16:18:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2123 states, 1274 states have (on average 1.2535321821036107) internal successors, (1597), 1335 states have internal predecessors, (1597), 577 states have call successors, (577), 251 states have call predecessors, (577), 250 states have return successors, (579), 561 states have call predecessors, (579), 575 states have call successors, (579) [2024-10-14 16:18:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2753 transitions. [2024-10-14 16:18:15,657 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 2753 transitions. Word has length 93 [2024-10-14 16:18:15,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:15,657 INFO L471 AbstractCegarLoop]: Abstraction has 2123 states and 2753 transitions. [2024-10-14 16:18:15,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 16:18:15,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2753 transitions. [2024-10-14 16:18:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 16:18:15,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:15,659 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-14 16:18:15,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 16:18:15,659 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2024-10-14 16:18:15,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:15,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1861718394, now seen corresponding path program 1 times [2024-10-14 16:18:15,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:15,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589612687] [2024-10-14 16:18:15,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:15,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 16:18:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 16:18:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 16:18:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 16:18:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 16:18:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 16:18:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 16:18:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 16:18:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 16:18:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 16:18:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 16:18:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 16:18:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 16:18:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 16:18:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 16:18:15,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:15,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589612687] [2024-10-14 16:18:15,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589612687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:15,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:15,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:18:15,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440751896] [2024-10-14 16:18:15,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:15,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:18:15,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:15,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:18:15,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:18:15,889 INFO L87 Difference]: Start difference. First operand 2123 states and 2753 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 16:18:18,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:18,053 INFO L93 Difference]: Finished difference Result 3005 states and 3836 transitions. [2024-10-14 16:18:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 16:18:18,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (19), 4 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 98 [2024-10-14 16:18:18,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:18,063 INFO L225 Difference]: With dead ends: 3005 [2024-10-14 16:18:18,063 INFO L226 Difference]: Without dead ends: 3003 [2024-10-14 16:18:18,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:18:18,064 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1670 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2453 mSolverCounterSat, 1101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1775 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1101 IncrementalHoareTripleChecker+Valid, 2453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:18,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1775 Valid, 1882 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1101 Valid, 2453 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 16:18:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2024-10-14 16:18:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 2890. [2024-10-14 16:18:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2890 states, 1724 states have (on average 1.24245939675174) internal successors, (2142), 1805 states have internal predecessors, (2142), 790 states have call successors, (790), 356 states have call predecessors, (790), 354 states have return successors, (792), 764 states have call predecessors, (792), 788 states have call successors, (792) [2024-10-14 16:18:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 3724 transitions. [2024-10-14 16:18:18,266 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 3724 transitions. Word has length 98 [2024-10-14 16:18:18,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:18,266 INFO L471 AbstractCegarLoop]: Abstraction has 2890 states and 3724 transitions. [2024-10-14 16:18:18,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 16:18:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 3724 transitions. [2024-10-14 16:18:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 16:18:18,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:18,268 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-14 16:18:18,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 16:18:18,269 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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)] === [2024-10-14 16:18:18,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:18,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1127062782, now seen corresponding path program 1 times [2024-10-14 16:18:18,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:18,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593054440] [2024-10-14 16:18:18,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:18,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 16:18:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 16:18:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 16:18:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 16:18:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 16:18:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 16:18:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 16:18:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 16:18:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 16:18:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 16:18:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 16:18:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 16:18:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 16:18:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 16:18:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 16:18:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 16:18:18,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:18,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593054440] [2024-10-14 16:18:18,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593054440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:18,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:18,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:18:18,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707804225] [2024-10-14 16:18:18,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:18,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:18:18,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:18,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:18:18,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:18:18,513 INFO L87 Difference]: Start difference. First operand 2890 states and 3724 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 16:18:20,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:20,021 INFO L93 Difference]: Finished difference Result 2890 states and 3724 transitions. [2024-10-14 16:18:20,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:18:20,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 4 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 103 [2024-10-14 16:18:20,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:20,033 INFO L225 Difference]: With dead ends: 2890 [2024-10-14 16:18:20,033 INFO L226 Difference]: Without dead ends: 2888 [2024-10-14 16:18:20,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:18:20,034 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1494 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1660 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:20,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1660 Valid, 1544 Invalid, 2579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1777 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 16:18:20,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2024-10-14 16:18:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2888. [2024-10-14 16:18:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 1723 states have (on average 1.2414393499709808) internal successors, (2139), 1803 states have internal predecessors, (2139), 790 states have call successors, (790), 356 states have call predecessors, (790), 354 states have return successors, (792), 764 states have call predecessors, (792), 788 states have call successors, (792) [2024-10-14 16:18:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 3721 transitions. [2024-10-14 16:18:20,276 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 3721 transitions. Word has length 103 [2024-10-14 16:18:20,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:20,276 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 3721 transitions. [2024-10-14 16:18:20,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 16:18:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 3721 transitions. [2024-10-14 16:18:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 16:18:20,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:20,278 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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] [2024-10-14 16:18:20,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 16:18:20,278 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)] === [2024-10-14 16:18:20,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:20,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1979569068, now seen corresponding path program 1 times [2024-10-14 16:18:20,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:20,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953485869] [2024-10-14 16:18:20,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:20,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 16:18:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 16:18:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 16:18:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 16:18:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 16:18:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 16:18:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 16:18:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 16:18:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-14 16:18:20,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:20,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953485869] [2024-10-14 16:18:20,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953485869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:20,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:20,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:18:20,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939550577] [2024-10-14 16:18:20,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:20,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:18:20,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:20,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:18:20,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:18:20,461 INFO L87 Difference]: Start difference. First operand 2888 states and 3721 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 16:18:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:22,480 INFO L93 Difference]: Finished difference Result 5305 states and 6834 transitions. [2024-10-14 16:18:22,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:18:22,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (20), 5 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 112 [2024-10-14 16:18:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:22,491 INFO L225 Difference]: With dead ends: 5305 [2024-10-14 16:18:22,492 INFO L226 Difference]: Without dead ends: 3110 [2024-10-14 16:18:22,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:18:22,497 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 1037 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 1015 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 3158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1015 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:22,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1780 Invalid, 3158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1015 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 16:18:22,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2024-10-14 16:18:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 2889. [2024-10-14 16:18:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 1724 states have (on average 1.2412993039443156) internal successors, (2140), 1804 states have internal predecessors, (2140), 790 states have call successors, (790), 356 states have call predecessors, (790), 354 states have return successors, (792), 764 states have call predecessors, (792), 788 states have call successors, (792) [2024-10-14 16:18:22,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 3722 transitions. [2024-10-14 16:18:22,715 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 3722 transitions. Word has length 112 [2024-10-14 16:18:22,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:22,716 INFO L471 AbstractCegarLoop]: Abstraction has 2889 states and 3722 transitions. [2024-10-14 16:18:22,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 16:18:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 3722 transitions. [2024-10-14 16:18:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 16:18:22,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:22,718 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-14 16:18:22,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 16:18:22,718 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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)] === [2024-10-14 16:18:22,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:22,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1079846413, now seen corresponding path program 1 times [2024-10-14 16:18:22,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:22,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463206318] [2024-10-14 16:18:22,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:22,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 16:18:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 16:18:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 16:18:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 16:18:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 16:18:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 16:18:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 16:18:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 16:18:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 16:18:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 16:18:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 16:18:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 16:18:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 16:18:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 16:18:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 16:18:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 16:18:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 16:18:22,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:22,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463206318] [2024-10-14 16:18:22,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463206318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:22,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:22,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:18:22,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776049220] [2024-10-14 16:18:22,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:22,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:18:22,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:22,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:18:22,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:18:22,946 INFO L87 Difference]: Start difference. First operand 2889 states and 3722 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 16:18:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:25,157 INFO L93 Difference]: Finished difference Result 3160 states and 4012 transitions. [2024-10-14 16:18:25,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:18:25,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (21), 4 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 108 [2024-10-14 16:18:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:25,168 INFO L225 Difference]: With dead ends: 3160 [2024-10-14 16:18:25,168 INFO L226 Difference]: Without dead ends: 3158 [2024-10-14 16:18:25,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:18:25,170 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1428 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 2756 mSolverCounterSat, 1033 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 3789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1033 IncrementalHoareTripleChecker+Valid, 2756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:25,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 1963 Invalid, 3789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1033 Valid, 2756 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 16:18:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3158 states. [2024-10-14 16:18:25,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3158 to 3045. [2024-10-14 16:18:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3045 states, 1812 states have (on average 1.2301324503311257) internal successors, (2229), 1892 states have internal predecessors, (2229), 830 states have call successors, (830), 384 states have call predecessors, (830), 382 states have return successors, (832), 804 states have call predecessors, (832), 828 states have call successors, (832) [2024-10-14 16:18:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 3045 states and 3891 transitions. [2024-10-14 16:18:25,482 INFO L78 Accepts]: Start accepts. Automaton has 3045 states and 3891 transitions. Word has length 108 [2024-10-14 16:18:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:25,482 INFO L471 AbstractCegarLoop]: Abstraction has 3045 states and 3891 transitions. [2024-10-14 16:18:25,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 16:18:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 3045 states and 3891 transitions. [2024-10-14 16:18:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 16:18:25,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:25,484 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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] [2024-10-14 16:18:25,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 16:18:25,484 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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)] === [2024-10-14 16:18:25,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:25,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1425887978, now seen corresponding path program 1 times [2024-10-14 16:18:25,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:25,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829505690] [2024-10-14 16:18:25,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:25,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 16:18:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 16:18:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 16:18:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 16:18:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 16:18:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 16:18:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 16:18:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 16:18:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-14 16:18:25,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:25,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829505690] [2024-10-14 16:18:25,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829505690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:25,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:25,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 16:18:25,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281210700] [2024-10-14 16:18:25,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:25,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 16:18:25,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:25,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 16:18:25,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:18:25,728 INFO L87 Difference]: Start difference. First operand 3045 states and 3891 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 16:18:28,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:28,315 INFO L93 Difference]: Finished difference Result 3302 states and 4217 transitions. [2024-10-14 16:18:28,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 16:18:28,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 5 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 116 [2024-10-14 16:18:28,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:28,325 INFO L225 Difference]: With dead ends: 3302 [2024-10-14 16:18:28,325 INFO L226 Difference]: Without dead ends: 3300 [2024-10-14 16:18:28,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-10-14 16:18:28,326 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 2277 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 2805 mSolverCounterSat, 1675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2394 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 4480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1675 IncrementalHoareTripleChecker+Valid, 2805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:28,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2394 Valid, 2126 Invalid, 4480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1675 Valid, 2805 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 16:18:28,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2024-10-14 16:18:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 3045. [2024-10-14 16:18:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3045 states, 1812 states have (on average 1.228476821192053) internal successors, (2226), 1892 states have internal predecessors, (2226), 830 states have call successors, (830), 384 states have call predecessors, (830), 382 states have return successors, (832), 804 states have call predecessors, (832), 828 states have call successors, (832) [2024-10-14 16:18:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 3045 states and 3888 transitions. [2024-10-14 16:18:28,584 INFO L78 Accepts]: Start accepts. Automaton has 3045 states and 3888 transitions. Word has length 116 [2024-10-14 16:18:28,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:28,585 INFO L471 AbstractCegarLoop]: Abstraction has 3045 states and 3888 transitions. [2024-10-14 16:18:28,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 16:18:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3045 states and 3888 transitions. [2024-10-14 16:18:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 16:18:28,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:28,586 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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] [2024-10-14 16:18:28,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 16:18:28,586 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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)] === [2024-10-14 16:18:28,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:28,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1114850539, now seen corresponding path program 1 times [2024-10-14 16:18:28,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:28,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646463144] [2024-10-14 16:18:28,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:28,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 16:18:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 16:18:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 16:18:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 16:18:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 16:18:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 16:18:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 16:18:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 16:18:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-14 16:18:28,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:28,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646463144] [2024-10-14 16:18:28,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646463144] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 16:18:28,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065692305] [2024-10-14 16:18:28,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:28,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 16:18:28,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:18:28,770 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) [2024-10-14 16:18:28,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 16:18:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:29,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 1154 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 16:18:29,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 16:18:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-14 16:18:29,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 16:18:29,385 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-14 16:18:29,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065692305] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 16:18:29,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 16:18:29,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-10-14 16:18:29,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475287705] [2024-10-14 16:18:29,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 16:18:29,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 16:18:29,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:29,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 16:18:29,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:18:29,387 INFO L87 Difference]: Start difference. First operand 3045 states and 3888 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 16:18:31,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:31,336 INFO L93 Difference]: Finished difference Result 5481 states and 7032 transitions. [2024-10-14 16:18:31,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:18:31,336 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-10-14 16:18:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:31,346 INFO L225 Difference]: With dead ends: 5481 [2024-10-14 16:18:31,346 INFO L226 Difference]: Without dead ends: 3285 [2024-10-14 16:18:31,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-14 16:18:31,351 INFO L432 NwaCegarLoop]: 618 mSDtfsCounter, 1080 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 2892 mSolverCounterSat, 1025 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 2229 SdHoareTripleChecker+Invalid, 3917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1025 IncrementalHoareTripleChecker+Valid, 2892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:31,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 2229 Invalid, 3917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1025 Valid, 2892 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 16:18:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2024-10-14 16:18:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 3072. [2024-10-14 16:18:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 1836 states have (on average 1.2320261437908497) internal successors, (2262), 1919 states have internal predecessors, (2262), 833 states have call successors, (833), 384 states have call predecessors, (833), 382 states have return successors, (835), 807 states have call predecessors, (835), 831 states have call successors, (835) [2024-10-14 16:18:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 3930 transitions. [2024-10-14 16:18:31,584 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 3930 transitions. Word has length 116 [2024-10-14 16:18:31,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:31,585 INFO L471 AbstractCegarLoop]: Abstraction has 3072 states and 3930 transitions. [2024-10-14 16:18:31,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 16:18:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 3930 transitions. [2024-10-14 16:18:31,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 16:18:31,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:31,586 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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] [2024-10-14 16:18:31,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 16:18:31,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 16:18:31,787 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)] === [2024-10-14 16:18:31,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash -181458179, now seen corresponding path program 1 times [2024-10-14 16:18:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:31,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401735401] [2024-10-14 16:18:31,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:31,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:31,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:31,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:31,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:31,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 16:18:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:31,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:31,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:31,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:31,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 16:18:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:31,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 16:18:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:31,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:31,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:31,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:31,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 16:18:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:31,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:32,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 16:18:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:32,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 16:18:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:32,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 16:18:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:32,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 16:18:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:32,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:32,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:32,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-14 16:18:32,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:32,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401735401] [2024-10-14 16:18:32,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401735401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:32,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:32,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 16:18:32,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463209669] [2024-10-14 16:18:32,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:32,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 16:18:32,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:32,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 16:18:32,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:18:32,034 INFO L87 Difference]: Start difference. First operand 3072 states and 3930 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 16:18:34,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:34,157 INFO L93 Difference]: Finished difference Result 3285 states and 4227 transitions. [2024-10-14 16:18:34,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 16:18:34,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 5 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 118 [2024-10-14 16:18:34,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:34,165 INFO L225 Difference]: With dead ends: 3285 [2024-10-14 16:18:34,165 INFO L226 Difference]: Without dead ends: 3283 [2024-10-14 16:18:34,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-14 16:18:34,167 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1860 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 1175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2043 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1175 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:34,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2043 Valid, 1788 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1175 Valid, 2131 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 16:18:34,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2024-10-14 16:18:34,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 3070. [2024-10-14 16:18:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 1835 states have (on average 1.2277929155313352) internal successors, (2253), 1917 states have internal predecessors, (2253), 833 states have call successors, (833), 384 states have call predecessors, (833), 382 states have return successors, (835), 807 states have call predecessors, (835), 831 states have call successors, (835) [2024-10-14 16:18:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3921 transitions. [2024-10-14 16:18:34,401 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3921 transitions. Word has length 118 [2024-10-14 16:18:34,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:34,401 INFO L471 AbstractCegarLoop]: Abstraction has 3070 states and 3921 transitions. [2024-10-14 16:18:34,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 16:18:34,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3921 transitions. [2024-10-14 16:18:34,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 16:18:34,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:34,403 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-14 16:18:34,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 16:18:34,403 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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)] === [2024-10-14 16:18:34,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:34,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2007273750, now seen corresponding path program 1 times [2024-10-14 16:18:34,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:34,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435787533] [2024-10-14 16:18:34,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:34,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 16:18:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 16:18:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 16:18:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 16:18:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 16:18:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 16:18:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 16:18:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 16:18:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 16:18:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 16:18:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 16:18:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 16:18:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 16:18:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 16:18:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 16:18:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 16:18:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 16:18:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 16:18:34,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:34,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435787533] [2024-10-14 16:18:34,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435787533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:34,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:34,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:18:34,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798123562] [2024-10-14 16:18:34,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:34,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:18:34,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:34,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:18:34,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:18:34,638 INFO L87 Difference]: Start difference. First operand 3070 states and 3921 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 16:18:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:36,236 INFO L93 Difference]: Finished difference Result 3070 states and 3921 transitions. [2024-10-14 16:18:36,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:18:36,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (22), 4 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 113 [2024-10-14 16:18:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:36,245 INFO L225 Difference]: With dead ends: 3070 [2024-10-14 16:18:36,245 INFO L226 Difference]: Without dead ends: 3068 [2024-10-14 16:18:36,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:18:36,246 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1482 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:36,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 1544 Invalid, 2571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 16:18:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2024-10-14 16:18:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2024-10-14 16:18:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 1834 states have (on average 1.2268266085059978) internal successors, (2250), 1915 states have internal predecessors, (2250), 833 states have call successors, (833), 384 states have call predecessors, (833), 382 states have return successors, (835), 807 states have call predecessors, (835), 831 states have call successors, (835) [2024-10-14 16:18:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 3918 transitions. [2024-10-14 16:18:36,511 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 3918 transitions. Word has length 113 [2024-10-14 16:18:36,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:36,511 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 3918 transitions. [2024-10-14 16:18:36,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 16:18:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 3918 transitions. [2024-10-14 16:18:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 16:18:36,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:36,513 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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] [2024-10-14 16:18:36,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 16:18:36,513 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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)] === [2024-10-14 16:18:36,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:36,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1714656341, now seen corresponding path program 1 times [2024-10-14 16:18:36,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:36,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535339367] [2024-10-14 16:18:36,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:36,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 16:18:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 16:18:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 16:18:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 16:18:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 16:18:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 16:18:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 16:18:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 16:18:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-14 16:18:36,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:36,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535339367] [2024-10-14 16:18:36,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535339367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:36,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:36,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 16:18:36,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250925551] [2024-10-14 16:18:36,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:36,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 16:18:36,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:36,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 16:18:36,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:18:36,770 INFO L87 Difference]: Start difference. First operand 3068 states and 3918 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 16:18:39,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:39,261 INFO L93 Difference]: Finished difference Result 5508 states and 7061 transitions. [2024-10-14 16:18:39,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 16:18:39,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 5 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 120 [2024-10-14 16:18:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:39,271 INFO L225 Difference]: With dead ends: 5508 [2024-10-14 16:18:39,271 INFO L226 Difference]: Without dead ends: 3289 [2024-10-14 16:18:39,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:18:39,275 INFO L432 NwaCegarLoop]: 615 mSDtfsCounter, 1014 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 2871 mSolverCounterSat, 1012 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 3883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1012 IncrementalHoareTripleChecker+Valid, 2871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:39,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 2204 Invalid, 3883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1012 Valid, 2871 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 16:18:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2024-10-14 16:18:39,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 3076. [2024-10-14 16:18:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3076 states, 1842 states have (on average 1.225841476655809) internal successors, (2258), 1923 states have internal predecessors, (2258), 833 states have call successors, (833), 384 states have call predecessors, (833), 382 states have return successors, (835), 807 states have call predecessors, (835), 831 states have call successors, (835) [2024-10-14 16:18:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 3926 transitions. [2024-10-14 16:18:39,525 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 3926 transitions. Word has length 120 [2024-10-14 16:18:39,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:39,525 INFO L471 AbstractCegarLoop]: Abstraction has 3076 states and 3926 transitions. [2024-10-14 16:18:39,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 16:18:39,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 3926 transitions. [2024-10-14 16:18:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 16:18:39,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:39,527 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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] [2024-10-14 16:18:39,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 16:18:39,527 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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)] === [2024-10-14 16:18:39,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1569193705, now seen corresponding path program 1 times [2024-10-14 16:18:39,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:39,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450560377] [2024-10-14 16:18:39,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:39,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:39,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:39,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:39,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:39,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 16:18:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 16:18:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 16:18:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 16:18:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 16:18:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 16:18:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 16:18:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 16:18:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-14 16:18:40,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:40,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450560377] [2024-10-14 16:18:40,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450560377] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 16:18:40,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238719549] [2024-10-14 16:18:40,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:40,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 16:18:40,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:18:40,238 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) [2024-10-14 16:18:40,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 16:18:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:40,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 16:18:40,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 16:18:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-14 16:18:40,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 16:18:40,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238719549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:40,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 16:18:40,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2024-10-14 16:18:40,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640747781] [2024-10-14 16:18:40,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:40,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:18:40,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:40,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:18:40,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-10-14 16:18:40,811 INFO L87 Difference]: Start difference. First operand 3076 states and 3926 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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) [2024-10-14 16:18:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:42,620 INFO L93 Difference]: Finished difference Result 3092 states and 3934 transitions. [2024-10-14 16:18:42,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:18:42,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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 120 [2024-10-14 16:18:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:42,629 INFO L225 Difference]: With dead ends: 3092 [2024-10-14 16:18:42,629 INFO L226 Difference]: Without dead ends: 3090 [2024-10-14 16:18:42,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-10-14 16:18:42,630 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 1081 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:42,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 1520 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 16:18:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2024-10-14 16:18:42,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 3090. [2024-10-14 16:18:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3090 states, 1849 states have (on average 1.2206598161168198) internal successors, (2257), 1929 states have internal predecessors, (2257), 833 states have call successors, (833), 392 states have call predecessors, (833), 390 states have return successors, (835), 807 states have call predecessors, (835), 831 states have call successors, (835) [2024-10-14 16:18:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 3925 transitions. [2024-10-14 16:18:42,917 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 3925 transitions. Word has length 120 [2024-10-14 16:18:42,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:42,918 INFO L471 AbstractCegarLoop]: Abstraction has 3090 states and 3925 transitions. [2024-10-14 16:18:42,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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) [2024-10-14 16:18:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 3925 transitions. [2024-10-14 16:18:42,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 16:18:42,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:42,920 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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] [2024-10-14 16:18:42,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 16:18:43,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 16:18:43,121 INFO L396 AbstractCegarLoop]: === Iteration 24 === 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)] === [2024-10-14 16:18:43,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:43,121 INFO L85 PathProgramCache]: Analyzing trace with hash -459332572, now seen corresponding path program 1 times [2024-10-14 16:18:43,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:43,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363381087] [2024-10-14 16:18:43,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:43,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 16:18:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 16:18:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 16:18:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 16:18:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 16:18:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 16:18:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 16:18:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 16:18:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-14 16:18:43,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:43,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363381087] [2024-10-14 16:18:43,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363381087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:43,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:43,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 16:18:43,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663542032] [2024-10-14 16:18:43,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:43,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 16:18:43,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:43,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 16:18:43,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:18:43,365 INFO L87 Difference]: Start difference. First operand 3090 states and 3925 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 16:18:45,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:45,396 INFO L93 Difference]: Finished difference Result 3303 states and 4222 transitions. [2024-10-14 16:18:45,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 16:18:45,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (20), 5 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 122 [2024-10-14 16:18:45,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:45,406 INFO L225 Difference]: With dead ends: 3303 [2024-10-14 16:18:45,406 INFO L226 Difference]: Without dead ends: 3301 [2024-10-14 16:18:45,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-14 16:18:45,407 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1832 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 2119 mSolverCounterSat, 1175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2015 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 3294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1175 IncrementalHoareTripleChecker+Valid, 2119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:45,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2015 Valid, 1788 Invalid, 3294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1175 Valid, 2119 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 16:18:45,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3301 states. [2024-10-14 16:18:45,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 3088. [2024-10-14 16:18:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3088 states, 1848 states have (on average 1.2164502164502164) internal successors, (2248), 1927 states have internal predecessors, (2248), 833 states have call successors, (833), 392 states have call predecessors, (833), 390 states have return successors, (835), 807 states have call predecessors, (835), 831 states have call successors, (835) [2024-10-14 16:18:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 3916 transitions. [2024-10-14 16:18:45,695 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 3916 transitions. Word has length 122 [2024-10-14 16:18:45,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:45,695 INFO L471 AbstractCegarLoop]: Abstraction has 3088 states and 3916 transitions. [2024-10-14 16:18:45,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 16:18:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 3916 transitions. [2024-10-14 16:18:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 16:18:45,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:45,697 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-14 16:18:45,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 16:18:45,697 INFO L396 AbstractCegarLoop]: === Iteration 25 === 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)] === [2024-10-14 16:18:45,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:45,697 INFO L85 PathProgramCache]: Analyzing trace with hash -945635097, now seen corresponding path program 1 times [2024-10-14 16:18:45,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:45,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625030056] [2024-10-14 16:18:45,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:45,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 16:18:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 16:18:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 16:18:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 16:18:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 16:18:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 16:18:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 16:18:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 16:18:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 16:18:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 16:18:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 16:18:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 16:18:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 16:18:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 16:18:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 16:18:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 16:18:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 16:18:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 16:18:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:45,944 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 16:18:45,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:45,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625030056] [2024-10-14 16:18:45,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625030056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:45,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:45,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:18:45,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753972909] [2024-10-14 16:18:45,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:45,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:18:45,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:45,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:18:45,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:18:45,945 INFO L87 Difference]: Start difference. First operand 3088 states and 3916 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 16:18:47,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:47,846 INFO L93 Difference]: Finished difference Result 3088 states and 3916 transitions. [2024-10-14 16:18:47,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:18:47,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (23), 4 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 118 [2024-10-14 16:18:47,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:47,855 INFO L225 Difference]: With dead ends: 3088 [2024-10-14 16:18:47,855 INFO L226 Difference]: Without dead ends: 3086 [2024-10-14 16:18:47,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:18:47,856 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1464 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:47,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 1544 Invalid, 2559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 16:18:47,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3086 states. [2024-10-14 16:18:48,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3086 to 3086. [2024-10-14 16:18:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 1847 states have (on average 1.2154845695722793) internal successors, (2245), 1925 states have internal predecessors, (2245), 833 states have call successors, (833), 392 states have call predecessors, (833), 390 states have return successors, (835), 807 states have call predecessors, (835), 831 states have call successors, (835) [2024-10-14 16:18:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 3913 transitions. [2024-10-14 16:18:48,145 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 3913 transitions. Word has length 118 [2024-10-14 16:18:48,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:48,145 INFO L471 AbstractCegarLoop]: Abstraction has 3086 states and 3913 transitions. [2024-10-14 16:18:48,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 16:18:48,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 3913 transitions. [2024-10-14 16:18:48,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-14 16:18:48,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:48,147 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-14 16:18:48,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 16:18:48,147 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2024-10-14 16:18:48,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:48,148 INFO L85 PathProgramCache]: Analyzing trace with hash 750777690, now seen corresponding path program 1 times [2024-10-14 16:18:48,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:48,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014002843] [2024-10-14 16:18:48,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:48,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 16:18:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 16:18:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 16:18:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 16:18:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 16:18:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 16:18:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 16:18:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 16:18:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 16:18:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 16:18:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 16:18:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 16:18:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 16:18:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 16:18:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 16:18:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 16:18:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 16:18:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 16:18:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 16:18:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 16:18:48,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:48,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014002843] [2024-10-14 16:18:48,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014002843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:48,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:48,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:18:48,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108603682] [2024-10-14 16:18:48,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:48,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:18:48,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:48,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:18:48,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:18:48,465 INFO L87 Difference]: Start difference. First operand 3086 states and 3913 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 16:18:50,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:50,047 INFO L93 Difference]: Finished difference Result 3086 states and 3913 transitions. [2024-10-14 16:18:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:18:50,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 123 [2024-10-14 16:18:50,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:50,060 INFO L225 Difference]: With dead ends: 3086 [2024-10-14 16:18:50,060 INFO L226 Difference]: Without dead ends: 3084 [2024-10-14 16:18:50,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:18:50,061 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1458 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1753 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1620 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:50,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1620 Valid, 1544 Invalid, 2555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1753 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 16:18:50,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2024-10-14 16:18:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 3084. [2024-10-14 16:18:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3084 states, 1846 states have (on average 1.2145178764897075) internal successors, (2242), 1923 states have internal predecessors, (2242), 833 states have call successors, (833), 392 states have call predecessors, (833), 390 states have return successors, (835), 807 states have call predecessors, (835), 831 states have call successors, (835) [2024-10-14 16:18:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 3910 transitions. [2024-10-14 16:18:50,394 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 3910 transitions. Word has length 123 [2024-10-14 16:18:50,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:50,394 INFO L471 AbstractCegarLoop]: Abstraction has 3084 states and 3910 transitions. [2024-10-14 16:18:50,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 16:18:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 3910 transitions. [2024-10-14 16:18:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 16:18:50,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:50,399 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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] [2024-10-14 16:18:50,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 16:18:50,399 INFO L396 AbstractCegarLoop]: === Iteration 27 === 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)] === [2024-10-14 16:18:50,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:50,399 INFO L85 PathProgramCache]: Analyzing trace with hash 79923495, now seen corresponding path program 1 times [2024-10-14 16:18:50,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:50,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394047508] [2024-10-14 16:18:50,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:50,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 16:18:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 16:18:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 16:18:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 16:18:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 16:18:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 16:18:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 16:18:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 16:18:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 16:18:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-14 16:18:50,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:50,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394047508] [2024-10-14 16:18:50,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394047508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:50,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:50,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 16:18:50,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131558585] [2024-10-14 16:18:50,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:50,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 16:18:50,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:50,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 16:18:50,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 16:18:50,697 INFO L87 Difference]: Start difference. First operand 3084 states and 3910 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 16:18:53,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:53,338 INFO L93 Difference]: Finished difference Result 3464 states and 4362 transitions. [2024-10-14 16:18:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 16:18:53,339 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (22), 6 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 133 [2024-10-14 16:18:53,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:53,350 INFO L225 Difference]: With dead ends: 3464 [2024-10-14 16:18:53,351 INFO L226 Difference]: Without dead ends: 3462 [2024-10-14 16:18:53,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-14 16:18:53,352 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1786 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 3073 mSolverCounterSat, 1134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1951 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 4207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1134 IncrementalHoareTripleChecker+Valid, 3073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:53,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1951 Valid, 2246 Invalid, 4207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1134 Valid, 3073 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 16:18:53,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2024-10-14 16:18:53,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3241. [2024-10-14 16:18:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 1952 states have (on average 1.2069672131147542) internal successors, (2356), 2028 states have internal predecessors, (2356), 847 states have call successors, (847), 430 states have call predecessors, (847), 428 states have return successors, (849), 821 states have call predecessors, (849), 845 states have call successors, (849) [2024-10-14 16:18:53,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4052 transitions. [2024-10-14 16:18:53,698 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4052 transitions. Word has length 133 [2024-10-14 16:18:53,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:53,698 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 4052 transitions. [2024-10-14 16:18:53,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 16:18:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4052 transitions. [2024-10-14 16:18:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 16:18:53,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:53,700 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 3, 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] [2024-10-14 16:18:53,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 16:18:53,700 INFO L396 AbstractCegarLoop]: === Iteration 28 === 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)] === [2024-10-14 16:18:53,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:53,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1902228568, now seen corresponding path program 2 times [2024-10-14 16:18:53,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:53,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393183491] [2024-10-14 16:18:53,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:53,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 16:18:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 16:18:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 16:18:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 16:18:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 16:18:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 16:18:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 16:18:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 16:18:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:53,960 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-14 16:18:53,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:53,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393183491] [2024-10-14 16:18:53,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393183491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:18:53,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:18:53,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 16:18:53,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591478819] [2024-10-14 16:18:53,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:18:53,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 16:18:53,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:18:53,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 16:18:53,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 16:18:53,961 INFO L87 Difference]: Start difference. First operand 3241 states and 4052 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 16:18:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:18:56,484 INFO L93 Difference]: Finished difference Result 3464 states and 4354 transitions. [2024-10-14 16:18:56,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 16:18:56,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 6 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 128 [2024-10-14 16:18:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:18:56,494 INFO L225 Difference]: With dead ends: 3464 [2024-10-14 16:18:56,494 INFO L226 Difference]: Without dead ends: 3462 [2024-10-14 16:18:56,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-10-14 16:18:56,496 INFO L432 NwaCegarLoop]: 605 mSDtfsCounter, 1455 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 3613 mSolverCounterSat, 1257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 4870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1257 IncrementalHoareTripleChecker+Valid, 3613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 16:18:56,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 2584 Invalid, 4870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1257 Valid, 3613 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 16:18:56,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2024-10-14 16:18:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3241. [2024-10-14 16:18:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 1952 states have (on average 1.2054303278688525) internal successors, (2353), 2028 states have internal predecessors, (2353), 847 states have call successors, (847), 430 states have call predecessors, (847), 428 states have return successors, (849), 821 states have call predecessors, (849), 845 states have call successors, (849) [2024-10-14 16:18:56,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4049 transitions. [2024-10-14 16:18:56,859 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4049 transitions. Word has length 128 [2024-10-14 16:18:56,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:18:56,860 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 4049 transitions. [2024-10-14 16:18:56,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 16:18:56,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4049 transitions. [2024-10-14 16:18:56,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-14 16:18:56,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:18:56,861 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:18:56,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 16:18:56,862 INFO L396 AbstractCegarLoop]: === Iteration 29 === 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)] === [2024-10-14 16:18:56,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:18:56,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1200903687, now seen corresponding path program 1 times [2024-10-14 16:18:56,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:18:56,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213379974] [2024-10-14 16:18:56,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:56,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:18:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 16:18:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 16:18:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 16:18:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 16:18:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 16:18:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 16:18:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 16:18:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 16:18:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 16:18:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 16:18:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 16:18:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 16:18:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 16:18:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 16:18:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 16:18:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 16:18:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 16:18:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 16:18:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-14 16:18:57,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:18:57,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213379974] [2024-10-14 16:18:57,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213379974] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 16:18:57,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305774762] [2024-10-14 16:18:57,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:18:57,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 16:18:57,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:18:57,398 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) [2024-10-14 16:18:57,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 16:18:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:18:57,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 16:18:57,855 INFO L278 TraceCheckSpWp]: Computing forward predicates...