./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i --full-output --preprocessor.use.memory.slicer false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fba957c5 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 ../../../trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.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 6e98c668899fc19a628c1d936389b59135bc3426718905326099068187537de8 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-fba957c-m [2023-11-23 10:26:33,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 10:26:33,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 10:26:33,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 10:26:33,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 10:26:33,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 10:26:33,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 10:26:33,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 10:26:33,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 10:26:33,418 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 10:26:33,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 10:26:33,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 10:26:33,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 10:26:33,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 10:26:33,420 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 10:26:33,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 10:26:33,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 10:26:33,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 10:26:33,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 10:26:33,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 10:26:33,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 10:26:33,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 10:26:33,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 10:26:33,422 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 10:26:33,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 10:26:33,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 10:26:33,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 10:26:33,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 10:26:33,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 10:26:33,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 10:26:33,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 10:26:33,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 10:26:33,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 10:26:33,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 10:26:33,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 10:26:33,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 10:26:33,425 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 10:26:33,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 10:26:33,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 10:26:33,426 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 -> 6e98c668899fc19a628c1d936389b59135bc3426718905326099068187537de8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 10:26:33,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 10:26:33,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 10:26:33,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 10:26:33,672 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 10:26:33,672 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 10:26:33,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2023-11-23 10:26:34,763 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 10:26:35,236 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 10:26:35,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2023-11-23 10:26:35,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9fb6d36/ce2a60bf13594869b31f53918f60f50f/FLAGddc847a62 [2023-11-23 10:26:35,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9fb6d36/ce2a60bf13594869b31f53918f60f50f [2023-11-23 10:26:35,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 10:26:35,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 10:26:35,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 10:26:35,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 10:26:35,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 10:26:35,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:26:35" (1/1) ... [2023-11-23 10:26:35,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51adf57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:26:35, skipping insertion in model container [2023-11-23 10:26:35,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:26:35" (1/1) ... [2023-11-23 10:26:35,442 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 10:26:38,720 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477597,477610] [2023-11-23 10:26:38,724 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477742,477755] [2023-11-23 10:26:38,724 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477888,477901] [2023-11-23 10:26:38,725 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478053,478066] [2023-11-23 10:26:38,725 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478211,478224] [2023-11-23 10:26:38,725 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478369,478382] [2023-11-23 10:26:38,726 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478527,478540] [2023-11-23 10:26:38,726 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478687,478700] [2023-11-23 10:26:38,726 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478846,478859] [2023-11-23 10:26:38,727 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478985,478998] [2023-11-23 10:26:38,727 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479127,479140] [2023-11-23 10:26:38,727 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479276,479289] [2023-11-23 10:26:38,763 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479415,479428] [2023-11-23 10:26:38,764 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479570,479583] [2023-11-23 10:26:38,764 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479730,479743] [2023-11-23 10:26:38,764 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479881,479894] [2023-11-23 10:26:38,764 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480032,480045] [2023-11-23 10:26:38,765 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480184,480197] [2023-11-23 10:26:38,765 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480333,480346] [2023-11-23 10:26:38,765 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480481,480494] [2023-11-23 10:26:38,765 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480638,480651] [2023-11-23 10:26:38,765 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480787,480800] [2023-11-23 10:26:38,766 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480943,480956] [2023-11-23 10:26:38,766 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481096,481109] [2023-11-23 10:26:38,766 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481242,481255] [2023-11-23 10:26:38,766 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481385,481398] [2023-11-23 10:26:38,767 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481537,481550] [2023-11-23 10:26:38,767 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481683,481696] [2023-11-23 10:26:38,767 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481828,481841] [2023-11-23 10:26:38,767 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481982,481995] [2023-11-23 10:26:38,768 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482133,482146] [2023-11-23 10:26:38,768 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482288,482301] [2023-11-23 10:26:38,768 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482440,482453] [2023-11-23 10:26:38,768 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482595,482608] [2023-11-23 10:26:38,768 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482759,482772] [2023-11-23 10:26:38,769 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482915,482928] [2023-11-23 10:26:38,769 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483079,483092] [2023-11-23 10:26:38,769 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483221,483234] [2023-11-23 10:26:38,769 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483379,483392] [2023-11-23 10:26:38,770 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483546,483559] [2023-11-23 10:26:38,772 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483705,483718] [2023-11-23 10:26:38,772 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483864,483877] [2023-11-23 10:26:38,772 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484013,484026] [2023-11-23 10:26:38,773 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484160,484173] [2023-11-23 10:26:38,773 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484299,484312] [2023-11-23 10:26:38,773 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484462,484475] [2023-11-23 10:26:38,773 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484628,484641] [2023-11-23 10:26:38,774 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484792,484805] [2023-11-23 10:26:38,774 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484957,484970] [2023-11-23 10:26:38,774 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485122,485135] [2023-11-23 10:26:38,774 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485288,485301] [2023-11-23 10:26:38,775 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485453,485466] [2023-11-23 10:26:38,788 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485620,485633] [2023-11-23 10:26:38,789 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485780,485793] [2023-11-23 10:26:38,789 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485942,485955] [2023-11-23 10:26:38,789 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486101,486114] [2023-11-23 10:26:38,790 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486247,486260] [2023-11-23 10:26:38,790 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486390,486403] [2023-11-23 10:26:38,790 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486534,486547] [2023-11-23 10:26:38,790 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486677,486690] [2023-11-23 10:26:38,790 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486821,486834] [2023-11-23 10:26:38,791 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486962,486975] [2023-11-23 10:26:38,791 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487100,487113] [2023-11-23 10:26:38,791 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487258,487271] [2023-11-23 10:26:38,791 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487417,487430] [2023-11-23 10:26:38,792 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487573,487586] [2023-11-23 10:26:38,792 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487722,487735] [2023-11-23 10:26:38,792 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487874,487887] [2023-11-23 10:26:38,792 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488025,488038] [2023-11-23 10:26:38,793 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488174,488187] [2023-11-23 10:26:38,793 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488326,488339] [2023-11-23 10:26:38,793 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488474,488487] [2023-11-23 10:26:38,793 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488627,488640] [2023-11-23 10:26:38,794 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488778,488791] [2023-11-23 10:26:38,794 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488928,488941] [2023-11-23 10:26:38,794 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489075,489088] [2023-11-23 10:26:38,794 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489226,489239] [2023-11-23 10:26:38,794 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489377,489390] [2023-11-23 10:26:38,795 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489525,489538] [2023-11-23 10:26:38,795 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489691,489704] [2023-11-23 10:26:38,795 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489860,489873] [2023-11-23 10:26:38,795 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490027,490040] [2023-11-23 10:26:38,796 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490195,490208] [2023-11-23 10:26:38,796 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490345,490358] [2023-11-23 10:26:38,796 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490492,490505] [2023-11-23 10:26:38,796 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490653,490666] [2023-11-23 10:26:38,796 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490823,490836] [2023-11-23 10:26:38,797 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490985,490998] [2023-11-23 10:26:38,806 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 10:26:38,837 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 10:26:38,915 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; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [7322] [2023-11-23 10:26:38,917 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; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [7329] [2023-11-23 10:26:38,917 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [7336] [2023-11-23 10:26:38,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (804), "i" (12UL)); [7387-7388] [2023-11-23 10:26:38,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (44UL), [paravirt_opptr] "i" (& pv_irq_ops.save_fl.func), [paravirt_clobber] "i" (1): "memory", "cc"); [7393-7395] [2023-11-23 10:26:38,921 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("movl %1,%0": "=r" (ret): "m" (*((unsigned int volatile *)addr)): "memory"); [7482] [2023-11-23 10:26:38,921 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("movl %0,%1": : "r" (val), "m" (*((unsigned int volatile *)addr)): "memory"); [7489] [2023-11-23 10:26:38,929 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/asm-generic/dma-mapping-common.h"), "i" (19), "i" (12UL)); [7609-7610] [2023-11-23 10:26:38,932 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/asm-generic/dma-mapping-common.h"), "i" (36), "i" (12UL)); [7643-7644] [2023-11-23 10:26:38,932 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/asm-generic/dma-mapping-common.h"), "i" (103), "i" (12UL)); [7680-7681] [2023-11-23 10:26:38,933 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/asm-generic/dma-mapping-common.h"), "i" (115), "i" (12UL)); [7717-7718] [2023-11-23 10:26:38,955 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [8141] [2023-11-23 10:26:39,123 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [9885] [2023-11-23 10:26:39,123 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [9888] [2023-11-23 10:26:39,124 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [9891] [2023-11-23 10:26:39,124 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [9894] [2023-11-23 10:26:39,124 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [9897] [2023-11-23 10:26:39,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((int *)arg): "ebx"); [9932-9933] [2023-11-23 10:26:39,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((int *)arg): "ebx"); [9936-9937] [2023-11-23 10:26:39,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((int *)arg): "ebx"); [9940-9941] [2023-11-23 10:26:39,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((int *)arg): "ebx"); [9944-9945] [2023-11-23 10:26:39,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((int *)arg): "ebx"); [9948-9949] [2023-11-23 10:26:39,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((int *)arg): "ebx"); [9979-9980] [2023-11-23 10:26:39,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((int *)arg): "ebx"); [9983-9984] [2023-11-23 10:26:39,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((int *)arg): "ebx"); [9987-9988] [2023-11-23 10:26:39,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((int *)arg): "ebx"); [9991-9992] [2023-11-23 10:26:39,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((int *)arg): "ebx"); [9995-9996] [2023-11-23 10:26:39,275 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477597,477610] [2023-11-23 10:26:39,275 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477742,477755] [2023-11-23 10:26:39,276 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477888,477901] [2023-11-23 10:26:39,276 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478053,478066] [2023-11-23 10:26:39,276 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478211,478224] [2023-11-23 10:26:39,276 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478369,478382] [2023-11-23 10:26:39,277 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478527,478540] [2023-11-23 10:26:39,277 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478687,478700] [2023-11-23 10:26:39,277 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478846,478859] [2023-11-23 10:26:39,278 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478985,478998] [2023-11-23 10:26:39,278 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479127,479140] [2023-11-23 10:26:39,279 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479276,479289] [2023-11-23 10:26:39,279 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479415,479428] [2023-11-23 10:26:39,280 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479570,479583] [2023-11-23 10:26:39,280 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479730,479743] [2023-11-23 10:26:39,280 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479881,479894] [2023-11-23 10:26:39,281 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480032,480045] [2023-11-23 10:26:39,281 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480184,480197] [2023-11-23 10:26:39,281 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480333,480346] [2023-11-23 10:26:39,281 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480481,480494] [2023-11-23 10:26:39,282 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480638,480651] [2023-11-23 10:26:39,282 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480787,480800] [2023-11-23 10:26:39,282 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480943,480956] [2023-11-23 10:26:39,283 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481096,481109] [2023-11-23 10:26:39,283 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481242,481255] [2023-11-23 10:26:39,283 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481385,481398] [2023-11-23 10:26:39,283 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481537,481550] [2023-11-23 10:26:39,284 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481683,481696] [2023-11-23 10:26:39,284 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481828,481841] [2023-11-23 10:26:39,284 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481982,481995] [2023-11-23 10:26:39,285 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482133,482146] [2023-11-23 10:26:39,285 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482288,482301] [2023-11-23 10:26:39,285 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482440,482453] [2023-11-23 10:26:39,286 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482595,482608] [2023-11-23 10:26:39,286 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482759,482772] [2023-11-23 10:26:39,286 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482915,482928] [2023-11-23 10:26:39,287 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483079,483092] [2023-11-23 10:26:39,287 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483221,483234] [2023-11-23 10:26:39,287 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483379,483392] [2023-11-23 10:26:39,288 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483546,483559] [2023-11-23 10:26:39,289 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483705,483718] [2023-11-23 10:26:39,289 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483864,483877] [2023-11-23 10:26:39,289 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484013,484026] [2023-11-23 10:26:39,290 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484160,484173] [2023-11-23 10:26:39,290 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484299,484312] [2023-11-23 10:26:39,290 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484462,484475] [2023-11-23 10:26:39,291 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484628,484641] [2023-11-23 10:26:39,291 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484792,484805] [2023-11-23 10:26:39,291 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484957,484970] [2023-11-23 10:26:39,291 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485122,485135] [2023-11-23 10:26:39,292 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485288,485301] [2023-11-23 10:26:39,292 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485453,485466] [2023-11-23 10:26:39,292 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485620,485633] [2023-11-23 10:26:39,293 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485780,485793] [2023-11-23 10:26:39,293 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485942,485955] [2023-11-23 10:26:39,293 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486101,486114] [2023-11-23 10:26:39,294 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486247,486260] [2023-11-23 10:26:39,294 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486390,486403] [2023-11-23 10:26:39,294 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486534,486547] [2023-11-23 10:26:39,295 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486677,486690] [2023-11-23 10:26:39,295 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486821,486834] [2023-11-23 10:26:39,295 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486962,486975] [2023-11-23 10:26:39,298 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487100,487113] [2023-11-23 10:26:39,298 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487258,487271] [2023-11-23 10:26:39,299 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487417,487430] [2023-11-23 10:26:39,299 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487573,487586] [2023-11-23 10:26:39,299 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487722,487735] [2023-11-23 10:26:39,299 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487874,487887] [2023-11-23 10:26:39,300 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488025,488038] [2023-11-23 10:26:39,300 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488174,488187] [2023-11-23 10:26:39,300 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488326,488339] [2023-11-23 10:26:39,300 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488474,488487] [2023-11-23 10:26:39,301 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488627,488640] [2023-11-23 10:26:39,301 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488778,488791] [2023-11-23 10:26:39,301 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488928,488941] [2023-11-23 10:26:39,302 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489075,489088] [2023-11-23 10:26:39,302 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489226,489239] [2023-11-23 10:26:39,302 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489377,489390] [2023-11-23 10:26:39,302 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489525,489538] [2023-11-23 10:26:39,303 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489691,489704] [2023-11-23 10:26:39,303 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489860,489873] [2023-11-23 10:26:39,303 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490027,490040] [2023-11-23 10:26:39,303 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490195,490208] [2023-11-23 10:26:39,304 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490345,490358] [2023-11-23 10:26:39,304 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490492,490505] [2023-11-23 10:26:39,304 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490653,490666] [2023-11-23 10:26:39,304 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490823,490836] [2023-11-23 10:26:39,305 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490985,490998] [2023-11-23 10:26:39,307 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 10:26:39,511 WARN L675 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 10:26:39,517 INFO L206 MainTranslator]: Completed translation [2023-11-23 10:26:39,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:26:39 WrapperNode [2023-11-23 10:26:39,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 10:26:39,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 10:26:39,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 10:26:39,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 10:26:39,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:26:39" (1/1) ... [2023-11-23 10:26:39,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:26:39" (1/1) ... [2023-11-23 10:26:39,754 INFO L138 Inliner]: procedures = 673, calls = 2774, calls flagged for inlining = 296, calls inlined = 204, statements flattened = 6281 [2023-11-23 10:26:39,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 10:26:39,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 10:26:39,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 10:26:39,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 10:26:39,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:26:39" (1/1) ... [2023-11-23 10:26:39,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:26:39" (1/1) ... [2023-11-23 10:26:39,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:26:39" (1/1) ... [2023-11-23 10:26:39,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:26:39" (1/1) ... [2023-11-23 10:26:39,961 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:26:39" (1/1) ... [2023-11-23 10:26:39,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:26:39" (1/1) ... [2023-11-23 10:26:40,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:26:39" (1/1) ... [2023-11-23 10:26:40,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:26:39" (1/1) ... [2023-11-23 10:26:40,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 10:26:40,067 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 10:26:40,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 10:26:40,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 10:26:40,068 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:26:39" (1/1) ... [2023-11-23 10:26:40,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 10:26:40,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:26:40,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 10:26:40,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 10:26:40,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_io_instance_callback_2_25 [2023-11-23 10:26:40,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_io_instance_callback_2_25 [2023-11-23 10:26:40,134 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_supply [2023-11-23 10:26:40,134 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_supply [2023-11-23 10:26:40,134 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_device [2023-11-23 10:26:40,134 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_device [2023-11-23 10:26:40,134 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2023-11-23 10:26:40,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2023-11-23 10:26:40,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2023-11-23 10:26:40,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2023-11-23 10:26:40,135 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_register [2023-11-23 10:26:40,135 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_register [2023-11-23 10:26:40,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-23 10:26:40,135 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-23 10:26:40,135 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_unmap [2023-11-23 10:26:40,135 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_unmap [2023-11-23 10:26:40,135 INFO L130 BoogieDeclarations]: Found specification of procedure panic [2023-11-23 10:26:40,135 INFO L138 BoogieDeclarations]: Found implementation of procedure panic [2023-11-23 10:26:40,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-23 10:26:40,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-23 10:26:40,136 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_read [2023-11-23 10:26:40,136 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_read [2023-11-23 10:26:40,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2023-11-23 10:26:40,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2023-11-23 10:26:40,137 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_activate_vcin [2023-11-23 10:26:40,137 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_activate_vcin [2023-11-23 10:26:40,137 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_remove_one [2023-11-23 10:26:40,137 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_remove_one [2023-11-23 10:26:40,137 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_io_poll [2023-11-23 10:26:40,138 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_io_poll [2023-11-23 10:26:40,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-23 10:26:40,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-23 10:26:40,138 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2023-11-23 10:26:40,138 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2023-11-23 10:26:40,138 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2023-11-23 10:26:40,138 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2023-11-23 10:26:40,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2023-11-23 10:26:40,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2023-11-23 10:26:40,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2023-11-23 10:26:40,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2023-11-23 10:26:40,139 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-23 10:26:40,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2023-11-23 10:26:40,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2023-11-23 10:26:40,139 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_check [2023-11-23 10:26:40,139 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_check [2023-11-23 10:26:40,139 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_getstats [2023-11-23 10:26:40,139 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_getstats [2023-11-23 10:26:40,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-23 10:26:40,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-23 10:26:40,140 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2023-11-23 10:26:40,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2023-11-23 10:26:40,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 10:26:40,140 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_init [2023-11-23 10:26:40,140 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_init [2023-11-23 10:26:40,140 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_shutdown [2023-11-23 10:26:40,140 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_shutdown [2023-11-23 10:26:40,141 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_detect [2023-11-23 10:26:40,141 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_detect [2023-11-23 10:26:40,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2023-11-23 10:26:40,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2023-11-23 10:26:40,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2023-11-23 10:26:40,141 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2023-11-23 10:26:40,141 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2023-11-23 10:26:40,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-23 10:26:40,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2023-11-23 10:26:40,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2023-11-23 10:26:40,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2023-11-23 10:26:40,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2023-11-23 10:26:40,142 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2023-11-23 10:26:40,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2023-11-23 10:26:40,142 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_map [2023-11-23 10:26:40,142 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_map [2023-11-23 10:26:40,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2023-11-23 10:26:40,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2023-11-23 10:26:40,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 10:26:40,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2023-11-23 10:26:40,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2023-11-23 10:26:40,143 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2023-11-23 10:26:40,145 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2023-11-23 10:26:40,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2023-11-23 10:26:40,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2023-11-23 10:26:40,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2023-11-23 10:26:40,146 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2023-11-23 10:26:40,146 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_proc_read [2023-11-23 10:26:40,146 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_proc_read [2023-11-23 10:26:40,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2023-11-23 10:26:40,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2023-11-23 10:26:40,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2023-11-23 10:26:40,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2023-11-23 10:26:40,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2023-11-23 10:26:40,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2023-11-23 10:26:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_open [2023-11-23 10:26:40,150 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_open [2023-11-23 10:26:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2023-11-23 10:26:40,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2023-11-23 10:26:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2023-11-23 10:26:40,150 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2023-11-23 10:26:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2023-11-23 10:26:40,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2023-11-23 10:26:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 10:26:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 10:26:40,151 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_write [2023-11-23 10:26:40,151 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_write [2023-11-23 10:26:40,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-23 10:26:40,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-23 10:26:40,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 10:26:40,151 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-11-23 10:26:40,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-11-23 10:26:40,151 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2023-11-23 10:26:40,151 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2023-11-23 10:26:40,151 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2023-11-23 10:26:40,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2023-11-23 10:26:40,152 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2023-11-23 10:26:40,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2023-11-23 10:26:40,152 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2023-11-23 10:26:40,152 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2023-11-23 10:26:40,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register [2023-11-23 10:26:40,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register [2023-11-23 10:26:40,152 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_get_esi [2023-11-23 10:26:40,152 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_get_esi [2023-11-23 10:26:40,153 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_monitor_getc [2023-11-23 10:26:40,153 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_monitor_getc [2023-11-23 10:26:40,153 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2023-11-23 10:26:40,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2023-11-23 10:26:40,153 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_free [2023-11-23 10:26:40,153 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_free [2023-11-23 10:26:40,153 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~u32~0 [2023-11-23 10:26:40,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~u32~0 [2023-11-23 10:26:40,154 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2023-11-23 10:26:40,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2023-11-23 10:26:40,154 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2023-11-23 10:26:40,154 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2023-11-23 10:26:40,154 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2023-11-23 10:26:40,154 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2023-11-23 10:26:40,154 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_close [2023-11-23 10:26:40,154 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_close [2023-11-23 10:26:40,154 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_reset [2023-11-23 10:26:40,154 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_reset [2023-11-23 10:26:40,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 10:26:40,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 10:26:40,155 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_rate_ctrl [2023-11-23 10:26:40,155 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_rate_ctrl [2023-11-23 10:26:40,155 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2023-11-23 10:26:40,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2023-11-23 10:26:40,155 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2023-11-23 10:26:40,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2023-11-23 10:26:40,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-23 10:26:40,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-23 10:26:40,155 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-23 10:26:40,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-23 10:26:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-23 10:26:40,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-23 10:26:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_irq_itoa [2023-11-23 10:26:40,156 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_irq_itoa [2023-11-23 10:26:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_init [2023-11-23 10:26:40,156 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_init [2023-11-23 10:26:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_struct_atmdev_ops_io_instance_2 [2023-11-23 10:26:40,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_struct_atmdev_ops_io_instance_2 [2023-11-23 10:26:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_ack [2023-11-23 10:26:40,157 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_ack [2023-11-23 10:26:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_130 [2023-11-23 10:26:40,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_130 [2023-11-23 10:26:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2023-11-23 10:26:40,157 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2023-11-23 10:26:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2023-11-23 10:26:40,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2023-11-23 10:26:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure sk_atm [2023-11-23 10:26:40,158 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_atm [2023-11-23 10:26:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2023-11-23 10:26:40,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2023-11-23 10:26:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_prom_read [2023-11-23 10:26:40,158 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_prom_read [2023-11-23 10:26:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 10:26:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2023-11-23 10:26:40,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2023-11-23 10:26:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 10:26:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_cpu [2023-11-23 10:26:40,158 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_cpu [2023-11-23 10:26:40,159 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_reset [2023-11-23 10:26:40,159 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_reset [2023-11-23 10:26:40,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 10:26:40,159 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2023-11-23 10:26:40,159 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2023-11-23 10:26:40,159 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-23 10:26:40,159 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-23 10:26:40,159 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2023-11-23 10:26:40,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2023-11-23 10:26:40,159 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_byte [2023-11-23 10:26:40,160 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_byte [2023-11-23 10:26:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2023-11-23 10:26:40,160 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2023-11-23 10:26:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_chunk_free [2023-11-23 10:26:40,160 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_chunk_free [2023-11-23 10:26:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2023-11-23 10:26:40,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2023-11-23 10:26:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2023-11-23 10:26:40,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2023-11-23 10:26:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2023-11-23 10:26:40,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2023-11-23 10:26:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2023-11-23 10:26:40,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2023-11-23 10:26:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_map [2023-11-23 10:26:40,161 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_map [2023-11-23 10:26:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_atm2fore_aal [2023-11-23 10:26:40,161 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_atm2fore_aal [2023-11-23 10:26:40,163 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2023-11-23 10:26:40,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2023-11-23 10:26:40,163 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2023-11-23 10:26:40,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2023-11-23 10:26:40,163 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2023-11-23 10:26:40,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2023-11-23 10:26:40,163 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2023-11-23 10:26:40,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2023-11-23 10:26:40,163 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2023-11-23 10:26:40,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2023-11-23 10:26:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2023-11-23 10:26:40,164 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2023-11-23 10:26:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register_150 [2023-11-23 10:26:40,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register_150 [2023-11-23 10:26:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2023-11-23 10:26:40,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2023-11-23 10:26:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-23 10:26:40,165 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-23 10:26:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2023-11-23 10:26:40,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2023-11-23 10:26:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_register_8_1 [2023-11-23 10:26:40,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_register_8_1 [2023-11-23 10:26:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 10:26:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2023-11-23 10:26:40,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2023-11-23 10:26:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_configure [2023-11-23 10:26:40,166 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_configure [2023-11-23 10:26:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-23 10:26:40,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-23 10:26:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2023-11-23 10:26:40,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2023-11-23 10:26:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2023-11-23 10:26:40,166 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2023-11-23 10:26:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2023-11-23 10:26:40,167 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2023-11-23 10:26:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_send [2023-11-23 10:26:40,167 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_send [2023-11-23 10:26:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_unmap [2023-11-23 10:26:40,167 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_unmap [2023-11-23 10:26:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_alloc [2023-11-23 10:26:40,167 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_alloc [2023-11-23 10:26:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2023-11-23 10:26:40,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2023-11-23 10:26:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2023-11-23 10:26:40,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2023-11-23 10:26:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2023-11-23 10:26:40,168 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2023-11-23 10:26:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_proc_read [2023-11-23 10:26:40,168 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_proc_read [2023-11-23 10:26:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_poll [2023-11-23 10:26:40,168 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_poll [2023-11-23 10:26:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2023-11-23 10:26:40,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2023-11-23 10:26:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2023-11-23 10:26:40,168 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2023-11-23 10:26:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 10:26:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2023-11-23 10:26:40,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2023-11-23 10:26:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2023-11-23 10:26:40,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2023-11-23 10:26:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_tx_irq [2023-11-23 10:26:40,169 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_tx_irq [2023-11-23 10:26:40,842 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 10:26:40,847 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 10:26:41,162 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-23 10:26:44,076 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 10:26:44,353 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 10:26:44,353 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-23 10:26:44,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:26:44 BoogieIcfgContainer [2023-11-23 10:26:44,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 10:26:44,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 10:26:44,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 10:26:44,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 10:26:44,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:26:35" (1/3) ... [2023-11-23 10:26:44,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4aa0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:26:44, skipping insertion in model container [2023-11-23 10:26:44,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:26:39" (2/3) ... [2023-11-23 10:26:44,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4aa0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:26:44, skipping insertion in model container [2023-11-23 10:26:44,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:26:44" (3/3) ... [2023-11-23 10:26:44,360 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2023-11-23 10:26:44,373 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 10:26:44,374 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-11-23 10:26:44,423 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 10:26:44,427 INFO L357 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, mHoare=true, 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;@5b72f66d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 10:26:44,427 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2023-11-23 10:26:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 1828 states, 1132 states have (on average 1.3604240282685511) internal successors, (1540), 1207 states have internal predecessors, (1540), 541 states have call successors, (541), 125 states have call predecessors, (541), 124 states have return successors, (536), 527 states have call predecessors, (536), 536 states have call successors, (536) [2023-11-23 10:26:44,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-23 10:26:44,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:26:44,443 INFO L195 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] [2023-11-23 10:26:44,443 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:26:44,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:26:44,447 INFO L85 PathProgramCache]: Analyzing trace with hash -676093612, now seen corresponding path program 1 times [2023-11-23 10:26:44,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:26:44,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65796125] [2023-11-23 10:26:44,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:26:44,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:26:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:45,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:26:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:45,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:26:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:45,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:26:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:45,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:26:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:45,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:26:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:45,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:26:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:45,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:26:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:45,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:26:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:45,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:26:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:45,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:26:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 10:26:45,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:26:45,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65796125] [2023-11-23 10:26:45,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65796125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:26:45,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:26:45,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:26:45,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833662939] [2023-11-23 10:26:45,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:26:45,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:26:45,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:26:45,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:26:45,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:26:45,329 INFO L87 Difference]: Start difference. First operand has 1828 states, 1132 states have (on average 1.3604240282685511) internal successors, (1540), 1207 states have internal predecessors, (1540), 541 states have call successors, (541), 125 states have call predecessors, (541), 124 states have return successors, (536), 527 states have call predecessors, (536), 536 states have call successors, (536) Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 4 states have internal predecessors, (23), 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) [2023-11-23 10:26:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:26:57,138 INFO L93 Difference]: Finished difference Result 5427 states and 8116 transitions. [2023-11-23 10:26:57,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 10:26:57,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 4 states have internal predecessors, (23), 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 51 [2023-11-23 10:26:57,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:26:57,191 INFO L225 Difference]: With dead ends: 5427 [2023-11-23 10:26:57,192 INFO L226 Difference]: Without dead ends: 3600 [2023-11-23 10:26:57,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-23 10:26:57,209 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 6630 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 7894 mSolverCounterSat, 4535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6715 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 12429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4535 IncrementalHoareTripleChecker+Valid, 7894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2023-11-23 10:26:57,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6715 Valid, 947 Invalid, 12429 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4535 Valid, 7894 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2023-11-23 10:26:57,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3600 states. [2023-11-23 10:26:57,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3600 to 3426. [2023-11-23 10:26:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3426 states, 2143 states have (on average 1.3187120858609427) internal successors, (2826), 2258 states have internal predecessors, (2826), 1025 states have call successors, (1025), 229 states have call predecessors, (1025), 228 states have return successors, (1056), 1003 states have call predecessors, (1056), 1023 states have call successors, (1056) [2023-11-23 10:26:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3426 states to 3426 states and 4907 transitions. [2023-11-23 10:26:57,417 INFO L78 Accepts]: Start accepts. Automaton has 3426 states and 4907 transitions. Word has length 51 [2023-11-23 10:26:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:26:57,417 INFO L495 AbstractCegarLoop]: Abstraction has 3426 states and 4907 transitions. [2023-11-23 10:26:57,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 4 states have internal predecessors, (23), 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) [2023-11-23 10:26:57,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3426 states and 4907 transitions. [2023-11-23 10:26:57,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-23 10:26:57,419 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:26:57,420 INFO L195 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] [2023-11-23 10:26:57,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 10:26:57,420 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:26:57,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:26:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1020744132, now seen corresponding path program 1 times [2023-11-23 10:26:57,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:26:57,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187063969] [2023-11-23 10:26:57,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:26:57,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:26:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:57,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:26:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:57,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:26:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:57,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:26:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:26:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:57,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:26:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:57,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:26:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:57,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:26:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:57,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:26:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:57,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:26:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:57,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:26:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:57,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:26:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:26:57,919 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 10:26:57,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:26:57,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187063969] [2023-11-23 10:26:57,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187063969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:26:57,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:26:57,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:26:57,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333661341] [2023-11-23 10:26:57,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:26:57,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:26:57,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:26:57,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:26:57,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:26:57,923 INFO L87 Difference]: Start difference. First operand 3426 states and 4907 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 4 states have internal predecessors, (26), 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) [2023-11-23 10:27:00,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:27:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:27:06,168 INFO L93 Difference]: Finished difference Result 3426 states and 4907 transitions. [2023-11-23 10:27:06,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:27:06,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 4 states have internal predecessors, (26), 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 56 [2023-11-23 10:27:06,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:27:06,181 INFO L225 Difference]: With dead ends: 3426 [2023-11-23 10:27:06,181 INFO L226 Difference]: Without dead ends: 3424 [2023-11-23 10:27:06,182 INFO L412 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 [2023-11-23 10:27:06,183 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 4246 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 4878 mSolverCounterSat, 2810 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4335 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 7689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2810 IncrementalHoareTripleChecker+Valid, 4878 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-11-23 10:27:06,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4335 Valid, 665 Invalid, 7689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4878 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2023-11-23 10:27:06,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3424 states. [2023-11-23 10:27:06,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3424 to 3424. [2023-11-23 10:27:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3424 states, 2142 states have (on average 1.3183940242763772) internal successors, (2824), 2256 states have internal predecessors, (2824), 1025 states have call successors, (1025), 229 states have call predecessors, (1025), 228 states have return successors, (1056), 1003 states have call predecessors, (1056), 1023 states have call successors, (1056) [2023-11-23 10:27:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3424 states to 3424 states and 4905 transitions. [2023-11-23 10:27:06,303 INFO L78 Accepts]: Start accepts. Automaton has 3424 states and 4905 transitions. Word has length 56 [2023-11-23 10:27:06,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:27:06,304 INFO L495 AbstractCegarLoop]: Abstraction has 3424 states and 4905 transitions. [2023-11-23 10:27:06,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 4 states have internal predecessors, (26), 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) [2023-11-23 10:27:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3424 states and 4905 transitions. [2023-11-23 10:27:06,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-23 10:27:06,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:27:06,311 INFO L195 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] [2023-11-23 10:27:06,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 10:27:06,312 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:27:06,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:27:06,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2052579956, now seen corresponding path program 1 times [2023-11-23 10:27:06,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:27:06,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980975273] [2023-11-23 10:27:06,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:27:06,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:27:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:06,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:27:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:06,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:27:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:06,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:27:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:06,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:27:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:06,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:27:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:06,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:27:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:06,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:27:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:06,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:27:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:06,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:27:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:06,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:27:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:06,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:27:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:06,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:27:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 10:27:06,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:27:06,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980975273] [2023-11-23 10:27:06,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980975273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:27:06,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:27:06,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:27:06,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021403362] [2023-11-23 10:27:06,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:27:06,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:27:06,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:27:06,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:27:06,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:27:06,808 INFO L87 Difference]: Start difference. First operand 3424 states and 4905 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 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) [2023-11-23 10:27:13,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:27:13,551 INFO L93 Difference]: Finished difference Result 3424 states and 4905 transitions. [2023-11-23 10:27:13,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:27:13,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 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 61 [2023-11-23 10:27:13,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:27:13,564 INFO L225 Difference]: With dead ends: 3424 [2023-11-23 10:27:13,564 INFO L226 Difference]: Without dead ends: 3422 [2023-11-23 10:27:13,565 INFO L412 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 [2023-11-23 10:27:13,566 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 4240 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 4875 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4328 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 7685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2810 IncrementalHoareTripleChecker+Valid, 4875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-11-23 10:27:13,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4328 Valid, 665 Invalid, 7685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4875 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2023-11-23 10:27:13,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2023-11-23 10:27:13,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 3422. [2023-11-23 10:27:13,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3422 states, 2141 states have (on average 1.3180756655768333) internal successors, (2822), 2254 states have internal predecessors, (2822), 1025 states have call successors, (1025), 229 states have call predecessors, (1025), 228 states have return successors, (1056), 1003 states have call predecessors, (1056), 1023 states have call successors, (1056) [2023-11-23 10:27:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 4903 transitions. [2023-11-23 10:27:13,725 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 4903 transitions. Word has length 61 [2023-11-23 10:27:13,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:27:13,726 INFO L495 AbstractCegarLoop]: Abstraction has 3422 states and 4903 transitions. [2023-11-23 10:27:13,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 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) [2023-11-23 10:27:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 4903 transitions. [2023-11-23 10:27:13,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-23 10:27:13,729 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:27:13,729 INFO L195 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] [2023-11-23 10:27:13,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 10:27:13,729 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:27:13,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:27:13,730 INFO L85 PathProgramCache]: Analyzing trace with hash -171893831, now seen corresponding path program 1 times [2023-11-23 10:27:13,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:27:13,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879224037] [2023-11-23 10:27:13,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:27:13,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:27:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:14,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:27:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:14,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:27:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:14,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:27:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:14,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:27:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:14,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:27:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:14,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:27:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:14,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:27:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:14,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:27:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:14,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:27:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:14,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:27:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:14,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:27:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:14,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:27:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:14,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:27:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:14,160 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 10:27:14,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:27:14,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879224037] [2023-11-23 10:27:14,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879224037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:27:14,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:27:14,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:27:14,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123713843] [2023-11-23 10:27:14,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:27:14,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:27:14,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:27:14,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:27:14,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:27:14,162 INFO L87 Difference]: Start difference. First operand 3422 states and 4903 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 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) [2023-11-23 10:27:21,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:27:21,485 INFO L93 Difference]: Finished difference Result 3422 states and 4903 transitions. [2023-11-23 10:27:21,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:27:21,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 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 66 [2023-11-23 10:27:21,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:27:21,501 INFO L225 Difference]: With dead ends: 3422 [2023-11-23 10:27:21,501 INFO L226 Difference]: Without dead ends: 3420 [2023-11-23 10:27:21,502 INFO L412 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 [2023-11-23 10:27:21,503 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 4234 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 4871 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4321 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 7681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2810 IncrementalHoareTripleChecker+Valid, 4871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-11-23 10:27:21,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4321 Valid, 665 Invalid, 7681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4871 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-11-23 10:27:21,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3420 states. [2023-11-23 10:27:21,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3420 to 3420. [2023-11-23 10:27:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3420 states, 2140 states have (on average 1.3177570093457944) internal successors, (2820), 2252 states have internal predecessors, (2820), 1025 states have call successors, (1025), 229 states have call predecessors, (1025), 228 states have return successors, (1056), 1003 states have call predecessors, (1056), 1023 states have call successors, (1056) [2023-11-23 10:27:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3420 states to 3420 states and 4901 transitions. [2023-11-23 10:27:21,623 INFO L78 Accepts]: Start accepts. Automaton has 3420 states and 4901 transitions. Word has length 66 [2023-11-23 10:27:21,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:27:21,623 INFO L495 AbstractCegarLoop]: Abstraction has 3420 states and 4901 transitions. [2023-11-23 10:27:21,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 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) [2023-11-23 10:27:21,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3420 states and 4901 transitions. [2023-11-23 10:27:21,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-23 10:27:21,625 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:27:21,625 INFO L195 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] [2023-11-23 10:27:21,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 10:27:21,625 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:27:21,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:27:21,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1852232062, now seen corresponding path program 1 times [2023-11-23 10:27:21,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:27:21,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446435023] [2023-11-23 10:27:21,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:27:21,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:27:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:21,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:27:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:21,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:27:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:21,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:27:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:21,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:27:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:21,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:27:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:21,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:27:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:21,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:27:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:21,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:27:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:21,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:27:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:22,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:27:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:22,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:27:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:22,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:27:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:22,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:27:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:22,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:27:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 10:27:22,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:27:22,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446435023] [2023-11-23 10:27:22,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446435023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:27:22,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:27:22,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:27:22,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489381323] [2023-11-23 10:27:22,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:27:22,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:27:22,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:27:22,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:27:22,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:27:22,039 INFO L87 Difference]: Start difference. First operand 3420 states and 4901 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 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) [2023-11-23 10:27:25,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:27:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:27:30,257 INFO L93 Difference]: Finished difference Result 3420 states and 4901 transitions. [2023-11-23 10:27:30,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:27:30,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 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 71 [2023-11-23 10:27:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:27:30,268 INFO L225 Difference]: With dead ends: 3420 [2023-11-23 10:27:30,268 INFO L226 Difference]: Without dead ends: 3418 [2023-11-23 10:27:30,269 INFO L412 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 [2023-11-23 10:27:30,270 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 4228 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 4867 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4314 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 7677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2810 IncrementalHoareTripleChecker+Valid, 4867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-11-23 10:27:30,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4314 Valid, 665 Invalid, 7677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4867 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2023-11-23 10:27:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2023-11-23 10:27:30,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 3418. [2023-11-23 10:27:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3418 states, 2139 states have (on average 1.3174380551659655) internal successors, (2818), 2250 states have internal predecessors, (2818), 1025 states have call successors, (1025), 229 states have call predecessors, (1025), 228 states have return successors, (1056), 1003 states have call predecessors, (1056), 1023 states have call successors, (1056) [2023-11-23 10:27:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 4899 transitions. [2023-11-23 10:27:30,408 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 4899 transitions. Word has length 71 [2023-11-23 10:27:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:27:30,408 INFO L495 AbstractCegarLoop]: Abstraction has 3418 states and 4899 transitions. [2023-11-23 10:27:30,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 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) [2023-11-23 10:27:30,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 4899 transitions. [2023-11-23 10:27:30,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 10:27:30,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:27:30,410 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:27:30,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 10:27:30,410 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:27:30,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:27:30,411 INFO L85 PathProgramCache]: Analyzing trace with hash -482682171, now seen corresponding path program 1 times [2023-11-23 10:27:30,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:27:30,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530603454] [2023-11-23 10:27:30,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:27:30,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:27:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:31,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:27:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:31,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:27:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:31,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:27:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:31,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:27:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:31,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:27:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:31,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:27:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:31,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:27:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:27:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:32,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:27:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:32,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:27:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:32,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 10:27:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:32,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:27:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:32,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:27:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:32,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:27:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:32,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:27:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:32,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 10:27:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-23 10:27:32,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:27:32,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530603454] [2023-11-23 10:27:32,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530603454] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 10:27:32,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040202941] [2023-11-23 10:27:32,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:27:32,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:27:32,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:27:32,095 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) [2023-11-23 10:27:32,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 10:27:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:27:33,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 1912 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-23 10:27:33,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 10:27:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 10:27:33,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 10:27:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 10:27:33,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040202941] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 10:27:33,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 10:27:33,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 22 [2023-11-23 10:27:33,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359434303] [2023-11-23 10:27:33,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 10:27:33,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-23 10:27:33,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:27:33,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-23 10:27:33,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2023-11-23 10:27:33,309 INFO L87 Difference]: Start difference. First operand 3418 states and 4899 transitions. Second operand has 22 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 8 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (28), 11 states have call predecessors, (28), 8 states have call successors, (28) [2023-11-23 10:27:36,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:27:39,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:27:41,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:28:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:28:03,106 INFO L93 Difference]: Finished difference Result 4386 states and 6213 transitions. [2023-11-23 10:28:03,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-23 10:28:03,107 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 8 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (28), 11 states have call predecessors, (28), 8 states have call successors, (28) Word has length 79 [2023-11-23 10:28:03,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:28:03,122 INFO L225 Difference]: With dead ends: 4386 [2023-11-23 10:28:03,122 INFO L226 Difference]: Without dead ends: 3619 [2023-11-23 10:28:03,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=1155, Unknown=0, NotChecked=0, Total=1332 [2023-11-23 10:28:03,129 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 3338 mSDsluCounter, 2542 mSDsCounter, 0 mSdLazyCounter, 32549 mSolverCounterSat, 2822 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3357 SdHoareTripleChecker+Valid, 2823 SdHoareTripleChecker+Invalid, 35371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 2822 IncrementalHoareTripleChecker+Valid, 32549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.0s IncrementalHoareTripleChecker+Time [2023-11-23 10:28:03,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3357 Valid, 2823 Invalid, 35371 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [2822 Valid, 32549 Invalid, 0 Unknown, 0 Unchecked, 29.0s Time] [2023-11-23 10:28:03,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3619 states. [2023-11-23 10:28:03,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3619 to 3445. [2023-11-23 10:28:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3445 states, 2155 states have (on average 1.3160092807424595) internal successors, (2836), 2268 states have internal predecessors, (2836), 1031 states have call successors, (1031), 229 states have call predecessors, (1031), 233 states have return successors, (1074), 1013 states have call predecessors, (1074), 1029 states have call successors, (1074) [2023-11-23 10:28:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 4941 transitions. [2023-11-23 10:28:03,297 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 4941 transitions. Word has length 79 [2023-11-23 10:28:03,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:28:03,298 INFO L495 AbstractCegarLoop]: Abstraction has 3445 states and 4941 transitions. [2023-11-23 10:28:03,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 8 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (28), 11 states have call predecessors, (28), 8 states have call successors, (28) [2023-11-23 10:28:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 4941 transitions. [2023-11-23 10:28:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-23 10:28:03,299 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:28:03,299 INFO L195 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] [2023-11-23 10:28:03,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 10:28:03,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-23 10:28:03,526 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:28:03,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:28:03,526 INFO L85 PathProgramCache]: Analyzing trace with hash -380593170, now seen corresponding path program 1 times [2023-11-23 10:28:03,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:28:03,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571719372] [2023-11-23 10:28:03,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:28:03,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:28:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:03,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:03,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:28:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:03,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:28:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:03,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:28:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:03,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:28:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:03,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:28:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:03,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:28:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:03,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:03,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:28:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:03,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:28:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:03,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:28:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:03,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:28:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:03,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:28:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:03,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:28:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:03,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:28:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 10:28:03,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:28:03,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571719372] [2023-11-23 10:28:03,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571719372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:28:03,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:28:03,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:28:03,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349814372] [2023-11-23 10:28:03,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:28:03,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:28:03,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:28:03,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:28:03,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:28:03,978 INFO L87 Difference]: Start difference. First operand 3445 states and 4941 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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) [2023-11-23 10:28:12,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:28:12,053 INFO L93 Difference]: Finished difference Result 3445 states and 4941 transitions. [2023-11-23 10:28:12,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:28:12,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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 76 [2023-11-23 10:28:12,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:28:12,064 INFO L225 Difference]: With dead ends: 3445 [2023-11-23 10:28:12,065 INFO L226 Difference]: Without dead ends: 3443 [2023-11-23 10:28:12,066 INFO L412 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 [2023-11-23 10:28:12,066 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 4222 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 4863 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4307 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 7673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2810 IncrementalHoareTripleChecker+Valid, 4863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-11-23 10:28:12,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4307 Valid, 665 Invalid, 7673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4863 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2023-11-23 10:28:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2023-11-23 10:28:12,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 3443. [2023-11-23 10:28:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3443 states, 2154 states have (on average 1.3156917363045497) internal successors, (2834), 2266 states have internal predecessors, (2834), 1031 states have call successors, (1031), 229 states have call predecessors, (1031), 233 states have return successors, (1074), 1013 states have call predecessors, (1074), 1029 states have call successors, (1074) [2023-11-23 10:28:12,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 4939 transitions. [2023-11-23 10:28:12,217 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 4939 transitions. Word has length 76 [2023-11-23 10:28:12,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:28:12,218 INFO L495 AbstractCegarLoop]: Abstraction has 3443 states and 4939 transitions. [2023-11-23 10:28:12,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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) [2023-11-23 10:28:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 4939 transitions. [2023-11-23 10:28:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-23 10:28:12,219 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:28:12,220 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:28:12,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 10:28:12,220 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:28:12,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:28:12,222 INFO L85 PathProgramCache]: Analyzing trace with hash 675428514, now seen corresponding path program 1 times [2023-11-23 10:28:12,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:28:12,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831393354] [2023-11-23 10:28:12,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:28:12,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:28:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:28:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:28:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:28:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 10:28:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:28:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:28:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 10:28:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:28:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:28:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 10:28:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:28:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:28:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:28:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:28:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 10:28:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 10:28:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-11-23 10:28:12,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:28:12,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831393354] [2023-11-23 10:28:12,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831393354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:28:12,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:28:12,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 10:28:12,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388958862] [2023-11-23 10:28:12,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:28:12,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 10:28:12,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:28:12,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 10:28:12,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 10:28:12,611 INFO L87 Difference]: Start difference. First operand 3443 states and 4939 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 10:28:14,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:28:21,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:28:21,718 INFO L93 Difference]: Finished difference Result 7074 states and 10226 transitions. [2023-11-23 10:28:21,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:28:21,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2023-11-23 10:28:21,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:28:21,733 INFO L225 Difference]: With dead ends: 7074 [2023-11-23 10:28:21,734 INFO L226 Difference]: Without dead ends: 3660 [2023-11-23 10:28:21,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-23 10:28:21,744 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 5488 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 4177 mSolverCounterSat, 4285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5589 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 8462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4285 IncrementalHoareTripleChecker+Valid, 4177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-11-23 10:28:21,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5589 Valid, 439 Invalid, 8462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4285 Valid, 4177 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2023-11-23 10:28:21,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2023-11-23 10:28:21,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3443. [2023-11-23 10:28:21,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3443 states, 2152 states have (on average 1.3141263940520447) internal successors, (2828), 2265 states have internal predecessors, (2828), 1031 states have call successors, (1031), 229 states have call predecessors, (1031), 236 states have return successors, (1086), 1014 states have call predecessors, (1086), 1029 states have call successors, (1086) [2023-11-23 10:28:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 4945 transitions. [2023-11-23 10:28:21,931 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 4945 transitions. Word has length 93 [2023-11-23 10:28:21,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:28:21,934 INFO L495 AbstractCegarLoop]: Abstraction has 3443 states and 4945 transitions. [2023-11-23 10:28:21,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 10:28:21,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 4945 transitions. [2023-11-23 10:28:21,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 10:28:21,936 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:28:21,936 INFO L195 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] [2023-11-23 10:28:21,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 10:28:21,937 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:28:21,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:28:21,937 INFO L85 PathProgramCache]: Analyzing trace with hash -759501170, now seen corresponding path program 1 times [2023-11-23 10:28:21,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:28:21,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386806596] [2023-11-23 10:28:21,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:28:21,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:28:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:22,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:22,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:28:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:22,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:28:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:22,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:28:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:22,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:28:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:22,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:28:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:22,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:28:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:22,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:22,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:28:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:22,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:28:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:22,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:28:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:22,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:28:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:22,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:28:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:22,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:28:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:22,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:28:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:22,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:28:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 10:28:22,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:28:22,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386806596] [2023-11-23 10:28:22,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386806596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:28:22,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:28:22,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:28:22,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443517731] [2023-11-23 10:28:22,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:28:22,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:28:22,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:28:22,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:28:22,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:28:22,354 INFO L87 Difference]: Start difference. First operand 3443 states and 4945 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 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) [2023-11-23 10:28:24,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:28:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:28:30,208 INFO L93 Difference]: Finished difference Result 3443 states and 4945 transitions. [2023-11-23 10:28:30,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:28:30,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 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 81 [2023-11-23 10:28:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:28:30,226 INFO L225 Difference]: With dead ends: 3443 [2023-11-23 10:28:30,227 INFO L226 Difference]: Without dead ends: 3441 [2023-11-23 10:28:30,228 INFO L412 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 [2023-11-23 10:28:30,228 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 4211 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 4858 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4295 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 7668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2810 IncrementalHoareTripleChecker+Valid, 4858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2023-11-23 10:28:30,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4295 Valid, 646 Invalid, 7668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4858 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2023-11-23 10:28:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2023-11-23 10:28:30,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 3441. [2023-11-23 10:28:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3441 states, 2151 states have (on average 1.3138075313807531) internal successors, (2826), 2263 states have internal predecessors, (2826), 1031 states have call successors, (1031), 229 states have call predecessors, (1031), 236 states have return successors, (1086), 1014 states have call predecessors, (1086), 1029 states have call successors, (1086) [2023-11-23 10:28:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 3441 states and 4943 transitions. [2023-11-23 10:28:30,412 INFO L78 Accepts]: Start accepts. Automaton has 3441 states and 4943 transitions. Word has length 81 [2023-11-23 10:28:30,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:28:30,413 INFO L495 AbstractCegarLoop]: Abstraction has 3441 states and 4943 transitions. [2023-11-23 10:28:30,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 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) [2023-11-23 10:28:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 4943 transitions. [2023-11-23 10:28:30,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-23 10:28:30,414 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:28:30,415 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:28:30,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 10:28:30,415 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:28:30,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:28:30,415 INFO L85 PathProgramCache]: Analyzing trace with hash -200402532, now seen corresponding path program 1 times [2023-11-23 10:28:30,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:28:30,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544952536] [2023-11-23 10:28:30,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:28:30,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:28:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:28:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:28:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:28:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 10:28:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:28:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:28:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 10:28:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:28:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:28:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 10:28:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:28:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:28:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:28:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:28:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 10:28:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 10:28:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 10:28:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-23 10:28:30,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:28:30,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544952536] [2023-11-23 10:28:30,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544952536] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 10:28:30,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258955255] [2023-11-23 10:28:30,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:28:30,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:28:30,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:28:30,849 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) [2023-11-23 10:28:30,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 10:28:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:31,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 2089 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 10:28:31,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 10:28:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-11-23 10:28:31,757 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 10:28:31,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258955255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:28:31,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 10:28:31,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-23 10:28:31,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125726866] [2023-11-23 10:28:31,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:28:31,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 10:28:31,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:28:31,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 10:28:31,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-23 10:28:31,759 INFO L87 Difference]: Start difference. First operand 3441 states and 4943 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 10:28:32,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:28:32,602 INFO L93 Difference]: Finished difference Result 6847 states and 9835 transitions. [2023-11-23 10:28:32,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 10:28:32,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2023-11-23 10:28:32,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:28:32,612 INFO L225 Difference]: With dead ends: 6847 [2023-11-23 10:28:32,612 INFO L226 Difference]: Without dead ends: 3435 [2023-11-23 10:28:32,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-23 10:28:32,621 INFO L413 NwaCegarLoop]: 2300 mSDtfsCounter, 2508 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2508 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 10:28:32,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2508 Valid, 2300 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 10:28:32,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2023-11-23 10:28:32,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3435. [2023-11-23 10:28:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3435 states, 2146 states have (on average 1.3126747437092265) internal successors, (2817), 2257 states have internal predecessors, (2817), 1031 states have call successors, (1031), 229 states have call predecessors, (1031), 236 states have return successors, (1086), 1014 states have call predecessors, (1086), 1029 states have call successors, (1086) [2023-11-23 10:28:32,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 4934 transitions. [2023-11-23 10:28:32,850 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 4934 transitions. Word has length 98 [2023-11-23 10:28:32,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:28:32,851 INFO L495 AbstractCegarLoop]: Abstraction has 3435 states and 4934 transitions. [2023-11-23 10:28:32,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 10:28:32,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 4934 transitions. [2023-11-23 10:28:32,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-23 10:28:32,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:28:32,853 INFO L195 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] [2023-11-23 10:28:32,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 10:28:33,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 10:28:33,064 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:28:33,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:28:33,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1715966206, now seen corresponding path program 1 times [2023-11-23 10:28:33,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:28:33,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008081215] [2023-11-23 10:28:33,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:28:33,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:28:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:28:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:28:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:28:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:28:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:28:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:28:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:28:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:28:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:28:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:28:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:28:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:28:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:28:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:28:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:28:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:33,413 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 10:28:33,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:28:33,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008081215] [2023-11-23 10:28:33,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008081215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:28:33,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:28:33,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:28:33,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546908673] [2023-11-23 10:28:33,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:28:33,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:28:33,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:28:33,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:28:33,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:28:33,415 INFO L87 Difference]: Start difference. First operand 3435 states and 4934 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 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) [2023-11-23 10:28:35,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:28:40,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:28:40,442 INFO L93 Difference]: Finished difference Result 3435 states and 4934 transitions. [2023-11-23 10:28:40,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:28:40,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 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 86 [2023-11-23 10:28:40,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:28:40,451 INFO L225 Difference]: With dead ends: 3435 [2023-11-23 10:28:40,451 INFO L226 Difference]: Without dead ends: 3433 [2023-11-23 10:28:40,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-23 10:28:40,453 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4200 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 4853 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4283 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 7663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2810 IncrementalHoareTripleChecker+Valid, 4853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-11-23 10:28:40,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4283 Valid, 627 Invalid, 7663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4853 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-11-23 10:28:40,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2023-11-23 10:28:40,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3433. [2023-11-23 10:28:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3433 states, 2145 states have (on average 1.3123543123543124) internal successors, (2815), 2255 states have internal predecessors, (2815), 1031 states have call successors, (1031), 229 states have call predecessors, (1031), 236 states have return successors, (1086), 1014 states have call predecessors, (1086), 1029 states have call successors, (1086) [2023-11-23 10:28:40,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 4932 transitions. [2023-11-23 10:28:40,669 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 4932 transitions. Word has length 86 [2023-11-23 10:28:40,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:28:40,670 INFO L495 AbstractCegarLoop]: Abstraction has 3433 states and 4932 transitions. [2023-11-23 10:28:40,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 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) [2023-11-23 10:28:40,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 4932 transitions. [2023-11-23 10:28:40,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-23 10:28:40,671 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:28:40,671 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:28:40,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 10:28:40,671 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:28:40,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:28:40,672 INFO L85 PathProgramCache]: Analyzing trace with hash 309829850, now seen corresponding path program 1 times [2023-11-23 10:28:40,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:28:40,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813600354] [2023-11-23 10:28:40,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:28:40,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:28:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:28:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:28:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:28:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 10:28:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:28:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:28:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 10:28:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:28:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:28:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 10:28:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:28:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:28:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:28:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:28:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 10:28:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 10:28:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-11-23 10:28:41,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:28:41,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813600354] [2023-11-23 10:28:41,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813600354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:28:41,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:28:41,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 10:28:41,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726091776] [2023-11-23 10:28:41,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:28:41,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 10:28:41,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:28:41,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 10:28:41,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 10:28:41,202 INFO L87 Difference]: Start difference. First operand 3433 states and 4932 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 10:28:43,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:28:46,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:28:47,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:28:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:28:58,207 INFO L93 Difference]: Finished difference Result 8201 states and 11795 transitions. [2023-11-23 10:28:58,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 10:28:58,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 102 [2023-11-23 10:28:58,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:28:58,227 INFO L225 Difference]: With dead ends: 8201 [2023-11-23 10:28:58,227 INFO L226 Difference]: Without dead ends: 4797 [2023-11-23 10:28:58,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2023-11-23 10:28:58,237 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 6141 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 11885 mSolverCounterSat, 4467 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6233 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 16353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4467 IncrementalHoareTripleChecker+Valid, 11885 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2023-11-23 10:28:58,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6233 Valid, 970 Invalid, 16353 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4467 Valid, 11885 Invalid, 1 Unknown, 0 Unchecked, 16.4s Time] [2023-11-23 10:28:58,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4797 states. [2023-11-23 10:28:58,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4797 to 4527. [2023-11-23 10:28:58,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4527 states, 2828 states have (on average 1.3065770862800565) internal successors, (3695), 2970 states have internal predecessors, (3695), 1313 states have call successors, (1313), 355 states have call predecessors, (1313), 365 states have return successors, (1378), 1285 states have call predecessors, (1378), 1311 states have call successors, (1378) [2023-11-23 10:28:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4527 states to 4527 states and 6386 transitions. [2023-11-23 10:28:58,576 INFO L78 Accepts]: Start accepts. Automaton has 4527 states and 6386 transitions. Word has length 102 [2023-11-23 10:28:58,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:28:58,576 INFO L495 AbstractCegarLoop]: Abstraction has 4527 states and 6386 transitions. [2023-11-23 10:28:58,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 10:28:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 4527 states and 6386 transitions. [2023-11-23 10:28:58,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-23 10:28:58,577 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:28:58,577 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:28:58,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 10:28:58,578 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:28:58,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:28:58,578 INFO L85 PathProgramCache]: Analyzing trace with hash 309889432, now seen corresponding path program 1 times [2023-11-23 10:28:58,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:28:58,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200593863] [2023-11-23 10:28:58,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:28:58,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:28:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:58,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:58,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:28:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:58,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:28:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:58,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:28:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:58,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 10:28:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:58,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:58,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:28:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:58,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:28:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:58,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 10:28:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:58,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:59,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:28:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:59,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:28:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:59,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 10:28:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:59,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:28:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:59,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:28:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:59,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:28:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:59,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:28:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:59,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:28:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:59,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 10:28:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:59,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 10:28:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:28:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-11-23 10:28:59,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:28:59,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200593863] [2023-11-23 10:28:59,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200593863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:28:59,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:28:59,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 10:28:59,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288561428] [2023-11-23 10:28:59,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:28:59,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 10:28:59,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:28:59,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 10:28:59,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 10:28:59,094 INFO L87 Difference]: Start difference. First operand 4527 states and 6386 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-23 10:29:01,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:29:02,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:29:12,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:29:12,284 INFO L93 Difference]: Finished difference Result 4791 states and 6814 transitions. [2023-11-23 10:29:12,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 10:29:12,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 102 [2023-11-23 10:29:12,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:29:12,295 INFO L225 Difference]: With dead ends: 4791 [2023-11-23 10:29:12,295 INFO L226 Difference]: Without dead ends: 4789 [2023-11-23 10:29:12,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2023-11-23 10:29:12,297 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 3322 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 8634 mSolverCounterSat, 2699 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3322 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 11334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2699 IncrementalHoareTripleChecker+Valid, 8634 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2023-11-23 10:29:12,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3322 Valid, 888 Invalid, 11334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2699 Valid, 8634 Invalid, 1 Unknown, 0 Unchecked, 12.7s Time] [2023-11-23 10:29:12,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4789 states. [2023-11-23 10:29:12,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4789 to 4531. [2023-11-23 10:29:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4531 states, 2832 states have (on average 1.3054378531073447) internal successors, (3697), 2974 states have internal predecessors, (3697), 1313 states have call successors, (1313), 355 states have call predecessors, (1313), 365 states have return successors, (1378), 1285 states have call predecessors, (1378), 1311 states have call successors, (1378) [2023-11-23 10:29:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 6388 transitions. [2023-11-23 10:29:12,615 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 6388 transitions. Word has length 102 [2023-11-23 10:29:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:29:12,616 INFO L495 AbstractCegarLoop]: Abstraction has 4531 states and 6388 transitions. [2023-11-23 10:29:12,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-23 10:29:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 6388 transitions. [2023-11-23 10:29:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-23 10:29:12,617 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:29:12,617 INFO L195 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] [2023-11-23 10:29:12,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 10:29:12,617 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:29:12,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:29:12,617 INFO L85 PathProgramCache]: Analyzing trace with hash 224095749, now seen corresponding path program 1 times [2023-11-23 10:29:12,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:29:12,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317898382] [2023-11-23 10:29:12,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:29:12,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:29:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:29:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:29:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:29:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:29:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:29:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:29:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:29:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:29:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:29:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:29:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:29:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:29:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:29:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:29:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:29:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:29:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:29:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:12,945 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 10:29:12,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:29:12,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317898382] [2023-11-23 10:29:12,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317898382] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:29:12,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:29:12,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:29:12,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400751994] [2023-11-23 10:29:12,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:29:12,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:29:12,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:29:12,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:29:12,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:29:12,948 INFO L87 Difference]: Start difference. First operand 4531 states and 6388 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, (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) [2023-11-23 10:29:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:29:20,498 INFO L93 Difference]: Finished difference Result 4531 states and 6388 transitions. [2023-11-23 10:29:20,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:29:20,499 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, (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 88 [2023-11-23 10:29:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:29:20,507 INFO L225 Difference]: With dead ends: 4531 [2023-11-23 10:29:20,507 INFO L226 Difference]: Without dead ends: 4529 [2023-11-23 10:29:20,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-23 10:29:20,508 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4192 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 4849 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4275 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 7659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2810 IncrementalHoareTripleChecker+Valid, 4849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-11-23 10:29:20,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4275 Valid, 627 Invalid, 7659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4849 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-11-23 10:29:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4529 states. [2023-11-23 10:29:20,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4529 to 4529. [2023-11-23 10:29:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4529 states, 2831 states have (on average 1.3051925114800424) internal successors, (3695), 2972 states have internal predecessors, (3695), 1313 states have call successors, (1313), 355 states have call predecessors, (1313), 365 states have return successors, (1378), 1285 states have call predecessors, (1378), 1311 states have call successors, (1378) [2023-11-23 10:29:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4529 states to 4529 states and 6386 transitions. [2023-11-23 10:29:20,793 INFO L78 Accepts]: Start accepts. Automaton has 4529 states and 6386 transitions. Word has length 88 [2023-11-23 10:29:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:29:20,793 INFO L495 AbstractCegarLoop]: Abstraction has 4529 states and 6386 transitions. [2023-11-23 10:29:20,793 INFO L496 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, (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) [2023-11-23 10:29:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 4529 states and 6386 transitions. [2023-11-23 10:29:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-23 10:29:20,794 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:29:20,794 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:29:20,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 10:29:20,794 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:29:20,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:29:20,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2141310218, now seen corresponding path program 1 times [2023-11-23 10:29:20,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:29:20,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135506275] [2023-11-23 10:29:20,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:29:20,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:29:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:29:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:29:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:29:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:29:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 10:29:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:29:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:29:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:29:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 10:29:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:29:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:29:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:29:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 10:29:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:29:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:29:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:29:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:29:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:29:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 10:29:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 10:29:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-11-23 10:29:21,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:29:21,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135506275] [2023-11-23 10:29:21,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135506275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:29:21,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:29:21,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:29:21,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085439398] [2023-11-23 10:29:21,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:29:21,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:29:21,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:29:21,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:29:21,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:29:21,214 INFO L87 Difference]: Start difference. First operand 4529 states and 6386 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 10:29:23,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:29:24,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:29:29,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:29:29,922 INFO L93 Difference]: Finished difference Result 9275 states and 13235 transitions. [2023-11-23 10:29:29,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:29:29,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2023-11-23 10:29:29,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:29:29,935 INFO L225 Difference]: With dead ends: 9275 [2023-11-23 10:29:29,935 INFO L226 Difference]: Without dead ends: 4775 [2023-11-23 10:29:29,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-23 10:29:29,948 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4879 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 3886 mSolverCounterSat, 3624 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4973 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 7510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3624 IncrementalHoareTripleChecker+Valid, 3886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-11-23 10:29:29,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4973 Valid, 522 Invalid, 7510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3624 Valid, 3886 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2023-11-23 10:29:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2023-11-23 10:29:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 4519. [2023-11-23 10:29:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4519 states, 2822 states have (on average 1.303330970942594) internal successors, (3678), 2962 states have internal predecessors, (3678), 1313 states have call successors, (1313), 355 states have call predecessors, (1313), 365 states have return successors, (1378), 1285 states have call predecessors, (1378), 1311 states have call successors, (1378) [2023-11-23 10:29:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4519 states to 4519 states and 6369 transitions. [2023-11-23 10:29:30,300 INFO L78 Accepts]: Start accepts. Automaton has 4519 states and 6369 transitions. Word has length 105 [2023-11-23 10:29:30,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:29:30,300 INFO L495 AbstractCegarLoop]: Abstraction has 4519 states and 6369 transitions. [2023-11-23 10:29:30,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 10:29:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 4519 states and 6369 transitions. [2023-11-23 10:29:30,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-23 10:29:30,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:29:30,301 INFO L195 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] [2023-11-23 10:29:30,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 10:29:30,301 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:29:30,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:29:30,302 INFO L85 PathProgramCache]: Analyzing trace with hash -679030521, now seen corresponding path program 1 times [2023-11-23 10:29:30,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:29:30,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775738706] [2023-11-23 10:29:30,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:29:30,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:29:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:29:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:29:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:29:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:29:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:29:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:29:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:29:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:29:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:29:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:29:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:29:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:29:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:29:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:29:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:29:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:29:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:29:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 10:29:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 10:29:30,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:29:30,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775738706] [2023-11-23 10:29:30,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775738706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:29:30,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:29:30,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:29:30,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175319794] [2023-11-23 10:29:30,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:29:30,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:29:30,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:29:30,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:29:30,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:29:30,685 INFO L87 Difference]: Start difference. First operand 4519 states and 6369 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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) [2023-11-23 10:29:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:29:36,832 INFO L93 Difference]: Finished difference Result 4519 states and 6369 transitions. [2023-11-23 10:29:36,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:29:36,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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 93 [2023-11-23 10:29:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:29:36,841 INFO L225 Difference]: With dead ends: 4519 [2023-11-23 10:29:36,841 INFO L226 Difference]: Without dead ends: 4517 [2023-11-23 10:29:36,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-23 10:29:36,843 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4173 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 4835 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4255 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 7645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2810 IncrementalHoareTripleChecker+Valid, 4835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-11-23 10:29:36,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4255 Valid, 627 Invalid, 7645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4835 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-11-23 10:29:36,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2023-11-23 10:29:37,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 4517. [2023-11-23 10:29:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4517 states, 2821 states have (on average 1.303084012761432) internal successors, (3676), 2960 states have internal predecessors, (3676), 1313 states have call successors, (1313), 355 states have call predecessors, (1313), 365 states have return successors, (1378), 1285 states have call predecessors, (1378), 1311 states have call successors, (1378) [2023-11-23 10:29:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 6367 transitions. [2023-11-23 10:29:37,146 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 6367 transitions. Word has length 93 [2023-11-23 10:29:37,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:29:37,147 INFO L495 AbstractCegarLoop]: Abstraction has 4517 states and 6367 transitions. [2023-11-23 10:29:37,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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) [2023-11-23 10:29:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 6367 transitions. [2023-11-23 10:29:37,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-23 10:29:37,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:29:37,148 INFO L195 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] [2023-11-23 10:29:37,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 10:29:37,149 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:29:37,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:29:37,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2084572164, now seen corresponding path program 1 times [2023-11-23 10:29:37,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:29:37,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931479864] [2023-11-23 10:29:37,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:29:37,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:29:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:29:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:29:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:29:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:29:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:29:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:29:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:29:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:29:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:29:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:29:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:29:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:29:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:29:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:29:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:29:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:29:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:29:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 10:29:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 10:29:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 10:29:37,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:29:37,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931479864] [2023-11-23 10:29:37,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931479864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:29:37,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:29:37,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:29:37,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088389888] [2023-11-23 10:29:37,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:29:37,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:29:37,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:29:37,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:29:37,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:29:37,552 INFO L87 Difference]: Start difference. First operand 4517 states and 6367 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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) [2023-11-23 10:29:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:29:45,217 INFO L93 Difference]: Finished difference Result 4517 states and 6367 transitions. [2023-11-23 10:29:45,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:29:45,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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 98 [2023-11-23 10:29:45,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:29:45,227 INFO L225 Difference]: With dead ends: 4517 [2023-11-23 10:29:45,227 INFO L226 Difference]: Without dead ends: 4515 [2023-11-23 10:29:45,228 INFO L412 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 [2023-11-23 10:29:45,229 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4167 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 4831 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4248 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 7641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2810 IncrementalHoareTripleChecker+Valid, 4831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-11-23 10:29:45,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4248 Valid, 627 Invalid, 7641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4831 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-11-23 10:29:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2023-11-23 10:29:45,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 4515. [2023-11-23 10:29:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4515 states, 2820 states have (on average 1.3028368794326242) internal successors, (3674), 2958 states have internal predecessors, (3674), 1313 states have call successors, (1313), 355 states have call predecessors, (1313), 365 states have return successors, (1378), 1285 states have call predecessors, (1378), 1311 states have call successors, (1378) [2023-11-23 10:29:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 6365 transitions. [2023-11-23 10:29:45,583 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 6365 transitions. Word has length 98 [2023-11-23 10:29:45,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:29:45,583 INFO L495 AbstractCegarLoop]: Abstraction has 4515 states and 6365 transitions. [2023-11-23 10:29:45,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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) [2023-11-23 10:29:45,583 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 6365 transitions. [2023-11-23 10:29:45,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-23 10:29:45,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:29:45,584 INFO L195 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] [2023-11-23 10:29:45,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 10:29:45,584 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:29:45,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:29:45,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1605493931, now seen corresponding path program 1 times [2023-11-23 10:29:45,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:29:45,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524232767] [2023-11-23 10:29:45,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:29:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:29:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:29:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:29:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:29:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:29:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:29:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:29:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:29:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:29:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:29:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:29:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:29:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:29:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:29:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:29:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:29:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:29:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:29:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 10:29:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 10:29:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 10:29:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 10:29:45,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:29:45,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524232767] [2023-11-23 10:29:45,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524232767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:29:45,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:29:45,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:29:45,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741663248] [2023-11-23 10:29:45,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:29:45,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:29:45,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:29:45,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:29:45,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:29:45,955 INFO L87 Difference]: Start difference. First operand 4515 states and 6365 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 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) [2023-11-23 10:29:48,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:29:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:29:55,289 INFO L93 Difference]: Finished difference Result 4515 states and 6365 transitions. [2023-11-23 10:29:55,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:29:55,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 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 103 [2023-11-23 10:29:55,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:29:55,299 INFO L225 Difference]: With dead ends: 4515 [2023-11-23 10:29:55,300 INFO L226 Difference]: Without dead ends: 4513 [2023-11-23 10:29:55,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-23 10:29:55,301 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4161 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 4827 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4241 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 7637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2810 IncrementalHoareTripleChecker+Valid, 4827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-11-23 10:29:55,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4241 Valid, 627 Invalid, 7637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4827 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2023-11-23 10:29:55,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4513 states. [2023-11-23 10:29:55,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4513 to 4513. [2023-11-23 10:29:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4513 states, 2819 states have (on average 1.3025895707697766) internal successors, (3672), 2956 states have internal predecessors, (3672), 1313 states have call successors, (1313), 355 states have call predecessors, (1313), 365 states have return successors, (1378), 1285 states have call predecessors, (1378), 1311 states have call successors, (1378) [2023-11-23 10:29:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4513 states to 4513 states and 6363 transitions. [2023-11-23 10:29:55,665 INFO L78 Accepts]: Start accepts. Automaton has 4513 states and 6363 transitions. Word has length 103 [2023-11-23 10:29:55,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:29:55,665 INFO L495 AbstractCegarLoop]: Abstraction has 4513 states and 6363 transitions. [2023-11-23 10:29:55,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 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) [2023-11-23 10:29:55,666 INFO L276 IsEmpty]: Start isEmpty. Operand 4513 states and 6363 transitions. [2023-11-23 10:29:55,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-23 10:29:55,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:29:55,667 INFO L195 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] [2023-11-23 10:29:55,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 10:29:55,667 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:29:55,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:29:55,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1791441577, now seen corresponding path program 1 times [2023-11-23 10:29:55,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:29:55,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014509789] [2023-11-23 10:29:55,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:29:55,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:29:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:55,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:29:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:55,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:29:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:55,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:29:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:55,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:29:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:55,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:29:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:55,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:29:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:55,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:29:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:55,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:29:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:55,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:29:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:55,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:29:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:55,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:29:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:55,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:29:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:55,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:29:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:55,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:29:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:55,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:29:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:55,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:29:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:29:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:56,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 10:29:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:56,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 10:29:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:56,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 10:29:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:56,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:29:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:29:56,033 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 10:29:56,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:29:56,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014509789] [2023-11-23 10:29:56,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014509789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:29:56,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:29:56,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:29:56,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045735139] [2023-11-23 10:29:56,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:29:56,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:29:56,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:29:56,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:29:56,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:29:56,036 INFO L87 Difference]: Start difference. First operand 4513 states and 6363 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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) [2023-11-23 10:29:58,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:30:04,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:30:04,225 INFO L93 Difference]: Finished difference Result 4513 states and 6363 transitions. [2023-11-23 10:30:04,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:30:04,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 108 [2023-11-23 10:30:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:30:04,234 INFO L225 Difference]: With dead ends: 4513 [2023-11-23 10:30:04,234 INFO L226 Difference]: Without dead ends: 4511 [2023-11-23 10:30:04,236 INFO L412 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 [2023-11-23 10:30:04,236 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4155 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 4823 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4234 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 7633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2810 IncrementalHoareTripleChecker+Valid, 4823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-11-23 10:30:04,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4234 Valid, 627 Invalid, 7633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4823 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2023-11-23 10:30:04,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4511 states. [2023-11-23 10:30:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4511 to 4511. [2023-11-23 10:30:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4511 states, 2818 states have (on average 1.3023420865862314) internal successors, (3670), 2954 states have internal predecessors, (3670), 1313 states have call successors, (1313), 355 states have call predecessors, (1313), 365 states have return successors, (1378), 1285 states have call predecessors, (1378), 1311 states have call successors, (1378) [2023-11-23 10:30:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4511 states to 4511 states and 6361 transitions. [2023-11-23 10:30:04,570 INFO L78 Accepts]: Start accepts. Automaton has 4511 states and 6361 transitions. Word has length 108 [2023-11-23 10:30:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:30:04,570 INFO L495 AbstractCegarLoop]: Abstraction has 4511 states and 6361 transitions. [2023-11-23 10:30:04,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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) [2023-11-23 10:30:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 4511 states and 6361 transitions. [2023-11-23 10:30:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 10:30:04,571 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:30:04,571 INFO L195 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] [2023-11-23 10:30:04,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 10:30:04,571 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:30:04,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:30:04,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1503109957, now seen corresponding path program 1 times [2023-11-23 10:30:04,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:30:04,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292197951] [2023-11-23 10:30:04,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:30:04,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:30:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:30:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:30:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:30:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:30:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:30:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:30:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:30:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:30:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:30:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:30:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:30:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:30:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:30:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:30:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:30:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:30:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:30:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 10:30:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 10:30:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 10:30:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:30:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-23 10:30:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 10:30:04,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:30:04,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292197951] [2023-11-23 10:30:04,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292197951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:30:04,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:30:04,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:30:04,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859807785] [2023-11-23 10:30:04,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:30:04,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:30:04,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:30:04,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:30:04,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:30:04,971 INFO L87 Difference]: Start difference. First operand 4511 states and 6361 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-11-23 10:30:06,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:30:07,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:30:13,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:30:13,954 INFO L93 Difference]: Finished difference Result 4511 states and 6361 transitions. [2023-11-23 10:30:13,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:30:13,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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 113 [2023-11-23 10:30:13,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:30:13,964 INFO L225 Difference]: With dead ends: 4511 [2023-11-23 10:30:13,965 INFO L226 Difference]: Without dead ends: 4509 [2023-11-23 10:30:13,966 INFO L412 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 [2023-11-23 10:30:13,966 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4149 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 4819 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4227 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 7629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2810 IncrementalHoareTripleChecker+Valid, 4819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-11-23 10:30:13,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4227 Valid, 627 Invalid, 7629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4819 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2023-11-23 10:30:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4509 states. [2023-11-23 10:30:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4509 to 4509. [2023-11-23 10:30:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4509 states, 2817 states have (on average 1.3020944266950656) internal successors, (3668), 2952 states have internal predecessors, (3668), 1313 states have call successors, (1313), 355 states have call predecessors, (1313), 365 states have return successors, (1378), 1285 states have call predecessors, (1378), 1311 states have call successors, (1378) [2023-11-23 10:30:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 6359 transitions. [2023-11-23 10:30:14,325 INFO L78 Accepts]: Start accepts. Automaton has 4509 states and 6359 transitions. Word has length 113 [2023-11-23 10:30:14,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:30:14,325 INFO L495 AbstractCegarLoop]: Abstraction has 4509 states and 6359 transitions. [2023-11-23 10:30:14,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-11-23 10:30:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 4509 states and 6359 transitions. [2023-11-23 10:30:14,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-23 10:30:14,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:30:14,334 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:30:14,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-23 10:30:14,334 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:30:14,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:30:14,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1838726756, now seen corresponding path program 1 times [2023-11-23 10:30:14,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:30:14,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536502009] [2023-11-23 10:30:14,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:30:14,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:30:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:30:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:30:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:30:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:30:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 10:30:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:30:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:30:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:30:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 10:30:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:30:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:30:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:30:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 10:30:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:30:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:30:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:30:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:30:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:30:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 10:30:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 10:30:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 10:30:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-23 10:30:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-23 10:30:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:30:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-23 10:30:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-23 10:30:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-23 10:30:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-11-23 10:30:15,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:30:15,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536502009] [2023-11-23 10:30:15,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536502009] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 10:30:15,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65162130] [2023-11-23 10:30:15,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:30:15,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:30:15,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:30:15,679 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) [2023-11-23 10:30:15,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 10:30:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:16,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 2262 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-23 10:30:16,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 10:30:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-11-23 10:30:16,809 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 10:30:16,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65162130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:30:16,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 10:30:16,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 22 [2023-11-23 10:30:16,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301744481] [2023-11-23 10:30:16,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:30:16,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 10:30:16,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:30:16,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 10:30:16,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2023-11-23 10:30:16,811 INFO L87 Difference]: Start difference. First operand 4509 states and 6359 transitions. Second operand has 13 states, 9 states have (on average 5.666666666666667) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (23), 2 states have call predecessors, (23), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2023-11-23 10:30:19,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:30:25,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:30:28,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:30:28,213 INFO L93 Difference]: Finished difference Result 9051 states and 12770 transitions. [2023-11-23 10:30:28,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 10:30:28,213 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 5.666666666666667) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (23), 2 states have call predecessors, (23), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) Word has length 135 [2023-11-23 10:30:28,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:30:28,230 INFO L225 Difference]: With dead ends: 9051 [2023-11-23 10:30:28,230 INFO L226 Difference]: Without dead ends: 4569 [2023-11-23 10:30:28,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2023-11-23 10:30:28,241 INFO L413 NwaCegarLoop]: 2271 mSDtfsCounter, 15 mSDsluCounter, 24911 mSDsCounter, 0 mSdLazyCounter, 3094 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 27182 SdHoareTripleChecker+Invalid, 3102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2023-11-23 10:30:28,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 27182 Invalid, 3102 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 3094 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2023-11-23 10:30:28,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2023-11-23 10:30:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 4537. [2023-11-23 10:30:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4537 states, 2835 states have (on average 1.3001763668430335) internal successors, (3686), 2969 states have internal predecessors, (3686), 1321 states have call successors, (1321), 355 states have call predecessors, (1321), 367 states have return successors, (1390), 1295 states have call predecessors, (1390), 1319 states have call successors, (1390) [2023-11-23 10:30:28,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 6397 transitions. [2023-11-23 10:30:28,623 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 6397 transitions. Word has length 135 [2023-11-23 10:30:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:30:28,623 INFO L495 AbstractCegarLoop]: Abstraction has 4537 states and 6397 transitions. [2023-11-23 10:30:28,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 5.666666666666667) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (23), 2 states have call predecessors, (23), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2023-11-23 10:30:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 6397 transitions. [2023-11-23 10:30:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-23 10:30:28,624 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:30:28,624 INFO L195 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] [2023-11-23 10:30:28,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 10:30:28,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:30:28,830 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:30:28,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:30:28,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1379471037, now seen corresponding path program 1 times [2023-11-23 10:30:28,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:30:28,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704080837] [2023-11-23 10:30:28,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:30:28,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:30:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:30:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:30:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:30:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:30:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:30:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:30:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:30:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:30:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:30:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:30:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:30:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:30:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:30:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:30:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:30:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:30:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:30:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 10:30:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 10:30:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 10:30:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:30:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-23 10:30:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-23 10:30:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:30:29,229 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 10:30:29,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:30:29,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704080837] [2023-11-23 10:30:29,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704080837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:30:29,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:30:29,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:30:29,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326449569] [2023-11-23 10:30:29,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:30:29,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:30:29,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:30:29,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:30:29,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:30:29,231 INFO L87 Difference]: Start difference. First operand 4537 states and 6397 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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) [2023-11-23 10:30:30,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15