./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 true --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 true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-fba957c-m [2023-11-23 10:12:57,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 10:12:57,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 10:12:57,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 10:12:57,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 10:12:57,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 10:12:57,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 10:12:57,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 10:12:57,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 10:12:57,223 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 10:12:57,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 10:12:57,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 10:12:57,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 10:12:57,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 10:12:57,226 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 10:12:57,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 10:12:57,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 10:12:57,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 10:12:57,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 10:12:57,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 10:12:57,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 10:12:57,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 10:12:57,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 10:12:57,233 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 10:12:57,233 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 10:12:57,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 10:12:57,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 10:12:57,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 10:12:57,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 10:12:57,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 10:12:57,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 10:12:57,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 10:12:57,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 10:12:57,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 10:12:57,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 10:12:57,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 10:12:57,236 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 10:12:57,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 10:12:57,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 10:12:57,237 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 -> true [2023-11-23 10:12:57,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 10:12:57,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 10:12:57,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 10:12:57,477 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 10:12:57,492 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 10:12:57,493 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:12:58,629 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 10:12:59,136 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 10:12:59,137 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:12:59,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d9e919e7/42f84d25b2dd448680d52bdac204e812/FLAG2c62a3053 [2023-11-23 10:12:59,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d9e919e7/42f84d25b2dd448680d52bdac204e812 [2023-11-23 10:12:59,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 10:12:59,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 10:12:59,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 10:12:59,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 10:12:59,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 10:12:59,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:12:59" (1/1) ... [2023-11-23 10:12:59,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f014718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:12:59, skipping insertion in model container [2023-11-23 10:12:59,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:12:59" (1/1) ... [2023-11-23 10:12:59,438 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 10:13:03,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[477597,477610] [2023-11-23 10:13:03,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[477742,477755] [2023-11-23 10:13:03,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[477888,477901] [2023-11-23 10:13:03,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[478053,478066] [2023-11-23 10:13:03,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[478211,478224] [2023-11-23 10:13:03,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[478369,478382] [2023-11-23 10:13:03,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[478527,478540] [2023-11-23 10:13:03,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[478687,478700] [2023-11-23 10:13:03,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[478846,478859] [2023-11-23 10:13:03,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[478985,478998] [2023-11-23 10:13:03,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[479127,479140] [2023-11-23 10:13:03,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[479276,479289] [2023-11-23 10:13:03,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[479415,479428] [2023-11-23 10:13:03,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[479570,479583] [2023-11-23 10:13:03,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[479730,479743] [2023-11-23 10:13:03,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[479881,479894] [2023-11-23 10:13:03,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[480032,480045] [2023-11-23 10:13:03,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[480184,480197] [2023-11-23 10:13:03,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[480333,480346] [2023-11-23 10:13:03,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[480481,480494] [2023-11-23 10:13:03,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[480638,480651] [2023-11-23 10:13:03,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[480787,480800] [2023-11-23 10:13:03,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[480943,480956] [2023-11-23 10:13:03,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[481096,481109] [2023-11-23 10:13:03,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[481242,481255] [2023-11-23 10:13:03,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[481385,481398] [2023-11-23 10:13:03,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[481537,481550] [2023-11-23 10:13:03,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[481683,481696] [2023-11-23 10:13:03,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[481828,481841] [2023-11-23 10:13:03,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[481982,481995] [2023-11-23 10:13:03,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[482133,482146] [2023-11-23 10:13:03,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[482288,482301] [2023-11-23 10:13:03,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[482440,482453] [2023-11-23 10:13:03,296 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:13:03,297 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:13:03,297 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:13:03,297 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:13:03,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[483221,483234] [2023-11-23 10:13:03,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[483379,483392] [2023-11-23 10:13:03,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[483546,483559] [2023-11-23 10:13:03,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[483705,483718] [2023-11-23 10:13:03,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[483864,483877] [2023-11-23 10:13:03,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[484013,484026] [2023-11-23 10:13:03,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[484160,484173] [2023-11-23 10:13:03,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[484299,484312] [2023-11-23 10:13:03,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[484462,484475] [2023-11-23 10:13:03,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[484628,484641] [2023-11-23 10:13:03,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[484792,484805] [2023-11-23 10:13:03,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[484957,484970] [2023-11-23 10:13:03,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[485122,485135] [2023-11-23 10:13:03,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[485288,485301] [2023-11-23 10:13:03,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[485453,485466] [2023-11-23 10:13:03,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[485620,485633] [2023-11-23 10:13:03,306 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:13:03,306 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:13:03,306 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:13:03,307 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:13:03,307 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:13:03,308 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:13:03,308 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:13:03,308 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:13:03,309 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:13:03,309 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:13:03,309 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:13:03,310 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:13:03,311 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:13:03,311 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:13:03,311 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:13:03,312 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:13:03,312 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:13:03,313 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:13:03,313 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:13:03,313 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:13:03,314 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:13:03,314 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:13:03,315 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:13:03,315 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:13:03,315 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:13:03,316 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:13:03,316 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:13:03,316 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:13:03,317 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:13:03,317 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:13:03,317 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:13:03,318 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:13:03,318 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:13:03,319 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:13:03,319 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:13:03,331 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 10:13:03,376 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 10:13:03,521 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:13:03,523 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:13:03,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [7336] [2023-11-23 10:13:03,525 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (804), "i" (12UL)); [7387-7388] [2023-11-23 10:13:03,526 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:13:03,528 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:13:03,528 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:13:03,539 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:13:03,541 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:13:03,542 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:13:03,542 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:13:03,628 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [8141] [2023-11-23 10:13:03,764 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:13:03,764 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:13:03,764 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:13:03,765 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:13:03,765 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:13:03,768 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:13:03,769 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:13:03,769 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:13:03,769 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:13:03,769 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:13:03,770 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:13:03,770 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:13:03,770 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:13:03,770 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:13:03,771 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:13:03,928 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:13:03,929 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:13:03,929 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:13:03,930 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:13:03,930 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:13:03,930 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:13:03,930 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:13:03,931 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:13:03,931 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:13:03,932 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:13:03,932 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:13:03,932 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:13:03,933 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:13:03,933 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:13:03,933 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:13:03,933 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:13:03,934 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:13:03,934 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:13:03,934 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:13:03,934 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:13:03,935 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:13:03,935 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:13:03,935 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:13:03,935 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:13:03,936 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:13:03,936 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:13:03,936 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:13:03,936 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:13:03,937 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:13:03,937 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:13:03,937 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:13:03,937 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:13:03,938 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:13:03,938 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:13:03,939 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:13:03,939 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:13:03,939 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:13:03,940 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:13:03,940 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:13:03,941 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:13:03,942 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:13:03,942 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:13:03,942 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:13:03,942 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:13:03,943 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:13:03,943 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:13:03,943 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:13:03,944 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:13:03,944 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:13:03,944 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:13:03,945 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:13:03,945 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:13:03,945 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:13:03,946 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:13:03,946 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:13:03,947 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:13:03,947 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:13:03,947 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:13:03,948 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:13:03,948 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:13:03,948 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:13:03,948 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:13:03,952 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:13:03,952 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:13:03,952 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:13:03,953 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:13:03,953 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:13:03,953 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:13:03,954 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:13:03,954 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:13:03,956 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:13:03,957 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:13:03,958 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:13:03,958 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:13:03,959 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:13:03,959 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:13:03,959 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:13:03,959 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:13:03,961 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:13:03,962 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:13:03,966 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:13:03,967 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:13:03,967 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:13:03,967 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:13:03,968 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:13:03,968 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:13:03,968 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:13:03,968 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:13:03,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 10:13:04,167 WARN L675 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 10:13:04,173 INFO L206 MainTranslator]: Completed translation [2023-11-23 10:13:04,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:04 WrapperNode [2023-11-23 10:13:04,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 10:13:04,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 10:13:04,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 10:13:04,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 10:13:04,180 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:13:04" (1/1) ... [2023-11-23 10:13:04,271 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:13:04" (1/1) ... [2023-11-23 10:13:04,387 INFO L138 Inliner]: procedures = 673, calls = 2774, calls flagged for inlining = 296, calls inlined = 204, statements flattened = 6281 [2023-11-23 10:13:04,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 10:13:04,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 10:13:04,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 10:13:04,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 10:13:04,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:04" (1/1) ... [2023-11-23 10:13:04,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:04" (1/1) ... [2023-11-23 10:13:04,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:04" (1/1) ... [2023-11-23 10:13:05,499 INFO L175 MemorySlicer]: Split 1145 memory accesses to 46 slices as follows [5, 9, 938, 1, 2, 3, 7, 6, 4, 3, 0, 24, 2, 5, 6, 0, 5, 5, 4, 8, 2, 7, 6, 6, 4, 3, 4, 5, 3, 1, 3, 8, 2, 8, 5, 8, 4, 4, 0, 4, 4, 4, 3, 5, 3, 2]. 82 percent of accesses are in the largest equivalence class. The 183 initializations are split as follows [0, 0, 76, 1, 2, 0, 4, 4, 4, 0, 0, 0, 0, 5, 6, 0, 5, 5, 0, 8, 0, 0, 6, 6, 0, 0, 4, 0, 3, 0, 0, 8, 0, 8, 0, 8, 4, 4, 0, 0, 0, 4, 3, 5, 0, 0]. The 230 writes are split as follows [4, 9, 165, 0, 0, 0, 0, 0, 0, 2, 0, 24, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 1, 0, 4, 0, 0, 2, 0, 1, 0, 4, 0, 0, 0, 0, 2, 3, 0, 0, 0, 2, 1]. [2023-11-23 10:13:05,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:04" (1/1) ... [2023-11-23 10:13:05,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:04" (1/1) ... [2023-11-23 10:13:05,597 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:04" (1/1) ... [2023-11-23 10:13:05,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:04" (1/1) ... [2023-11-23 10:13:05,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:04" (1/1) ... [2023-11-23 10:13:05,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:04" (1/1) ... [2023-11-23 10:13:05,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 10:13:05,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 10:13:05,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 10:13:05,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 10:13:05,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:04" (1/1) ... [2023-11-23 10:13:05,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 10:13:05,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:13:05,766 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:13:05,788 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:13:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_io_instance_callback_2_25 [2023-11-23 10:13:05,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_io_instance_callback_2_25 [2023-11-23 10:13:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_supply [2023-11-23 10:13:05,811 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_supply [2023-11-23 10:13:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_device [2023-11-23 10:13:05,811 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_device [2023-11-23 10:13:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2023-11-23 10:13:05,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2023-11-23 10:13:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2023-11-23 10:13:05,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2023-11-23 10:13:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_register [2023-11-23 10:13:05,811 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_register [2023-11-23 10:13:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-23 10:13:05,812 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-23 10:13:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_unmap [2023-11-23 10:13:05,812 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_unmap [2023-11-23 10:13:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure panic [2023-11-23 10:13:05,812 INFO L138 BoogieDeclarations]: Found implementation of procedure panic [2023-11-23 10:13:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-23 10:13:05,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-23 10:13:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_read [2023-11-23 10:13:05,812 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_read [2023-11-23 10:13:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2023-11-23 10:13:05,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2023-11-23 10:13:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_activate_vcin [2023-11-23 10:13:05,813 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_activate_vcin [2023-11-23 10:13:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_remove_one [2023-11-23 10:13:05,813 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_remove_one [2023-11-23 10:13:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_io_poll [2023-11-23 10:13:05,813 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_io_poll [2023-11-23 10:13:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-23 10:13:05,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-23 10:13:05,814 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2023-11-23 10:13:05,814 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2023-11-23 10:13:05,814 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2023-11-23 10:13:05,814 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2023-11-23 10:13:05,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2023-11-23 10:13:05,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2023-11-23 10:13:05,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2023-11-23 10:13:05,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2023-11-23 10:13:05,814 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-23 10:13:05,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2023-11-23 10:13:05,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2023-11-23 10:13:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_check [2023-11-23 10:13:05,815 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_check [2023-11-23 10:13:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_getstats [2023-11-23 10:13:05,815 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_getstats [2023-11-23 10:13:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-23 10:13:05,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-23 10:13:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2023-11-23 10:13:05,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2023-11-23 10:13:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 10:13:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_init [2023-11-23 10:13:05,816 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_init [2023-11-23 10:13:05,816 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_shutdown [2023-11-23 10:13:05,816 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_shutdown [2023-11-23 10:13:05,816 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_detect [2023-11-23 10:13:05,816 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_detect [2023-11-23 10:13:05,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2023-11-23 10:13:05,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2023-11-23 10:13:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2023-11-23 10:13:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2023-11-23 10:13:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2023-11-23 10:13:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2023-11-23 10:13:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2023-11-23 10:13:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2023-11-23 10:13:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2023-11-23 10:13:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2023-11-23 10:13:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2023-11-23 10:13:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2023-11-23 10:13:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2023-11-23 10:13:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2023-11-23 10:13:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2023-11-23 10:13:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2023-11-23 10:13:05,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2023-11-23 10:13:05,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2023-11-23 10:13:05,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2023-11-23 10:13:05,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2023-11-23 10:13:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2023-11-23 10:13:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2023-11-23 10:13:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2023-11-23 10:13:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2023-11-23 10:13:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#22 [2023-11-23 10:13:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#23 [2023-11-23 10:13:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#24 [2023-11-23 10:13:05,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#25 [2023-11-23 10:13:05,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#26 [2023-11-23 10:13:05,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#27 [2023-11-23 10:13:05,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#28 [2023-11-23 10:13:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#29 [2023-11-23 10:13:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#30 [2023-11-23 10:13:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#31 [2023-11-23 10:13:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#32 [2023-11-23 10:13:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#33 [2023-11-23 10:13:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#34 [2023-11-23 10:13:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#35 [2023-11-23 10:13:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#36 [2023-11-23 10:13:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#37 [2023-11-23 10:13:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#38 [2023-11-23 10:13:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#39 [2023-11-23 10:13:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#40 [2023-11-23 10:13:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#41 [2023-11-23 10:13:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#42 [2023-11-23 10:13:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#43 [2023-11-23 10:13:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#44 [2023-11-23 10:13:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#45 [2023-11-23 10:13:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2023-11-23 10:13:05,825 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2023-11-23 10:13:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2023-11-23 10:13:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2023-11-23 10:13:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2023-11-23 10:13:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2023-11-23 10:13:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2023-11-23 10:13:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2023-11-23 10:13:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2023-11-23 10:13:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2023-11-23 10:13:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2023-11-23 10:13:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2023-11-23 10:13:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2023-11-23 10:13:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2023-11-23 10:13:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2023-11-23 10:13:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2023-11-23 10:13:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2023-11-23 10:13:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2023-11-23 10:13:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2023-11-23 10:13:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2023-11-23 10:13:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2023-11-23 10:13:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2023-11-23 10:13:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2023-11-23 10:13:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2023-11-23 10:13:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2023-11-23 10:13:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2023-11-23 10:13:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2023-11-23 10:13:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2023-11-23 10:13:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2023-11-23 10:13:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#27 [2023-11-23 10:13:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#28 [2023-11-23 10:13:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#29 [2023-11-23 10:13:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#30 [2023-11-23 10:13:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#31 [2023-11-23 10:13:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#32 [2023-11-23 10:13:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#33 [2023-11-23 10:13:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#34 [2023-11-23 10:13:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#35 [2023-11-23 10:13:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#36 [2023-11-23 10:13:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#37 [2023-11-23 10:13:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#38 [2023-11-23 10:13:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#39 [2023-11-23 10:13:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#40 [2023-11-23 10:13:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#41 [2023-11-23 10:13:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#42 [2023-11-23 10:13:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#43 [2023-11-23 10:13:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#44 [2023-11-23 10:13:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#45 [2023-11-23 10:13:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2023-11-23 10:13:05,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2023-11-23 10:13:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2023-11-23 10:13:05,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2023-11-23 10:13:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2023-11-23 10:13:05,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2023-11-23 10:13:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_map [2023-11-23 10:13:05,831 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_map [2023-11-23 10:13:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2023-11-23 10:13:05,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2023-11-23 10:13:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 10:13:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 10:13:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 10:13:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 10:13:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-23 10:13:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-23 10:13:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-23 10:13:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-23 10:13:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-11-23 10:13:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-11-23 10:13:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-11-23 10:13:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-11-23 10:13:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-11-23 10:13:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-11-23 10:13:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-11-23 10:13:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2023-11-23 10:13:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2023-11-23 10:13:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2023-11-23 10:13:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2023-11-23 10:13:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2023-11-23 10:13:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2023-11-23 10:13:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2023-11-23 10:13:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2023-11-23 10:13:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2023-11-23 10:13:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2023-11-23 10:13:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2023-11-23 10:13:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2023-11-23 10:13:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2023-11-23 10:13:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2023-11-23 10:13:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2023-11-23 10:13:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#30 [2023-11-23 10:13:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#31 [2023-11-23 10:13:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#32 [2023-11-23 10:13:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#33 [2023-11-23 10:13:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#34 [2023-11-23 10:13:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#35 [2023-11-23 10:13:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#36 [2023-11-23 10:13:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#37 [2023-11-23 10:13:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#38 [2023-11-23 10:13:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#39 [2023-11-23 10:13:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#40 [2023-11-23 10:13:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#41 [2023-11-23 10:13:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#42 [2023-11-23 10:13:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#43 [2023-11-23 10:13:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#44 [2023-11-23 10:13:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#45 [2023-11-23 10:13:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2023-11-23 10:13:05,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2023-11-23 10:13:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2023-11-23 10:13:05,836 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2023-11-23 10:13:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2023-11-23 10:13:05,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2023-11-23 10:13:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2023-11-23 10:13:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2023-11-23 10:13:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2023-11-23 10:13:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2023-11-23 10:13:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2023-11-23 10:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2023-11-23 10:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2023-11-23 10:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2023-11-23 10:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2023-11-23 10:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2023-11-23 10:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2023-11-23 10:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2023-11-23 10:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2023-11-23 10:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2023-11-23 10:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2023-11-23 10:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2023-11-23 10:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#16 [2023-11-23 10:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#17 [2023-11-23 10:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#18 [2023-11-23 10:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#19 [2023-11-23 10:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#20 [2023-11-23 10:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#21 [2023-11-23 10:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#22 [2023-11-23 10:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#23 [2023-11-23 10:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#24 [2023-11-23 10:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#25 [2023-11-23 10:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#26 [2023-11-23 10:13:05,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#27 [2023-11-23 10:13:05,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#28 [2023-11-23 10:13:05,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#29 [2023-11-23 10:13:05,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#30 [2023-11-23 10:13:05,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#31 [2023-11-23 10:13:05,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#32 [2023-11-23 10:13:05,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#33 [2023-11-23 10:13:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#34 [2023-11-23 10:13:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#35 [2023-11-23 10:13:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#36 [2023-11-23 10:13:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#37 [2023-11-23 10:13:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#38 [2023-11-23 10:13:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#39 [2023-11-23 10:13:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#40 [2023-11-23 10:13:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#41 [2023-11-23 10:13:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#42 [2023-11-23 10:13:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#43 [2023-11-23 10:13:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#44 [2023-11-23 10:13:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#45 [2023-11-23 10:13:05,841 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2023-11-23 10:13:05,841 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2023-11-23 10:13:05,841 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2023-11-23 10:13:05,841 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2023-11-23 10:13:05,841 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2023-11-23 10:13:05,841 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2023-11-23 10:13:05,841 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2023-11-23 10:13:05,841 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2023-11-23 10:13:05,841 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2023-11-23 10:13:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2023-11-23 10:13:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2023-11-23 10:13:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2023-11-23 10:13:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2023-11-23 10:13:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2023-11-23 10:13:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2023-11-23 10:13:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2023-11-23 10:13:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#16 [2023-11-23 10:13:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#17 [2023-11-23 10:13:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#18 [2023-11-23 10:13:05,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#19 [2023-11-23 10:13:05,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#20 [2023-11-23 10:13:05,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#21 [2023-11-23 10:13:05,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#22 [2023-11-23 10:13:05,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#23 [2023-11-23 10:13:05,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#24 [2023-11-23 10:13:05,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#25 [2023-11-23 10:13:05,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#26 [2023-11-23 10:13:05,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#27 [2023-11-23 10:13:05,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#28 [2023-11-23 10:13:05,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#29 [2023-11-23 10:13:05,844 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#30 [2023-11-23 10:13:05,844 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#31 [2023-11-23 10:13:05,844 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#32 [2023-11-23 10:13:05,844 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#33 [2023-11-23 10:13:05,844 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#34 [2023-11-23 10:13:05,844 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#35 [2023-11-23 10:13:05,844 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#36 [2023-11-23 10:13:05,844 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#37 [2023-11-23 10:13:05,844 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#38 [2023-11-23 10:13:05,844 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#39 [2023-11-23 10:13:05,844 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#40 [2023-11-23 10:13:05,845 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#41 [2023-11-23 10:13:05,845 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#42 [2023-11-23 10:13:05,845 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#43 [2023-11-23 10:13:05,845 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#44 [2023-11-23 10:13:05,845 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#45 [2023-11-23 10:13:05,845 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_proc_read [2023-11-23 10:13:05,845 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_proc_read [2023-11-23 10:13:05,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2023-11-23 10:13:05,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2023-11-23 10:13:05,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2023-11-23 10:13:05,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2023-11-23 10:13:05,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2023-11-23 10:13:05,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2023-11-23 10:13:05,846 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_open [2023-11-23 10:13:05,846 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_open [2023-11-23 10:13:05,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2023-11-23 10:13:05,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2023-11-23 10:13:05,846 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2023-11-23 10:13:05,846 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2023-11-23 10:13:05,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2023-11-23 10:13:05,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2023-11-23 10:13:05,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 10:13:05,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 10:13:05,847 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_write [2023-11-23 10:13:05,847 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_write [2023-11-23 10:13:05,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-23 10:13:05,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-23 10:13:05,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 10:13:05,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 10:13:05,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 10:13:05,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-23 10:13:05,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-23 10:13:05,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-23 10:13:05,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-23 10:13:05,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-11-23 10:13:05,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-11-23 10:13:05,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-11-23 10:13:05,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-11-23 10:13:05,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-11-23 10:13:05,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-11-23 10:13:05,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-11-23 10:13:05,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-11-23 10:13:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2023-11-23 10:13:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2023-11-23 10:13:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2023-11-23 10:13:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2023-11-23 10:13:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2023-11-23 10:13:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2023-11-23 10:13:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2023-11-23 10:13:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2023-11-23 10:13:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2023-11-23 10:13:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2023-11-23 10:13:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2023-11-23 10:13:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2023-11-23 10:13:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#27 [2023-11-23 10:13:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#28 [2023-11-23 10:13:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#29 [2023-11-23 10:13:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#30 [2023-11-23 10:13:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#31 [2023-11-23 10:13:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#32 [2023-11-23 10:13:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#33 [2023-11-23 10:13:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#34 [2023-11-23 10:13:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#35 [2023-11-23 10:13:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#36 [2023-11-23 10:13:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#37 [2023-11-23 10:13:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#38 [2023-11-23 10:13:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#39 [2023-11-23 10:13:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#40 [2023-11-23 10:13:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#41 [2023-11-23 10:13:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#42 [2023-11-23 10:13:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#43 [2023-11-23 10:13:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#44 [2023-11-23 10:13:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#45 [2023-11-23 10:13:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-11-23 10:13:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-11-23 10:13:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2023-11-23 10:13:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2023-11-23 10:13:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2023-11-23 10:13:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2023-11-23 10:13:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2023-11-23 10:13:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2023-11-23 10:13:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2023-11-23 10:13:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2023-11-23 10:13:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register [2023-11-23 10:13:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register [2023-11-23 10:13:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_get_esi [2023-11-23 10:13:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_get_esi [2023-11-23 10:13:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_monitor_getc [2023-11-23 10:13:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_monitor_getc [2023-11-23 10:13:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2023-11-23 10:13:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2023-11-23 10:13:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_free [2023-11-23 10:13:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_free [2023-11-23 10:13:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~u32~0 [2023-11-23 10:13:05,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~u32~0 [2023-11-23 10:13:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2023-11-23 10:13:05,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2023-11-23 10:13:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2023-11-23 10:13:05,854 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2023-11-23 10:13:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2023-11-23 10:13:05,854 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2023-11-23 10:13:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_close [2023-11-23 10:13:05,854 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_close [2023-11-23 10:13:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_reset [2023-11-23 10:13:05,855 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_reset [2023-11-23 10:13:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 10:13:05,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 10:13:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_rate_ctrl [2023-11-23 10:13:05,855 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_rate_ctrl [2023-11-23 10:13:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2023-11-23 10:13:05,855 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2023-11-23 10:13:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2023-11-23 10:13:05,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2023-11-23 10:13:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2023-11-23 10:13:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2023-11-23 10:13:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2023-11-23 10:13:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2023-11-23 10:13:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2023-11-23 10:13:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2023-11-23 10:13:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2023-11-23 10:13:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2023-11-23 10:13:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2023-11-23 10:13:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2023-11-23 10:13:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2023-11-23 10:13:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2023-11-23 10:13:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2023-11-23 10:13:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2023-11-23 10:13:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2023-11-23 10:13:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2023-11-23 10:13:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2023-11-23 10:13:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2023-11-23 10:13:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2023-11-23 10:13:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2023-11-23 10:13:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2023-11-23 10:13:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2023-11-23 10:13:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#22 [2023-11-23 10:13:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#23 [2023-11-23 10:13:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#24 [2023-11-23 10:13:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#25 [2023-11-23 10:13:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#26 [2023-11-23 10:13:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#27 [2023-11-23 10:13:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#28 [2023-11-23 10:13:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#29 [2023-11-23 10:13:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#30 [2023-11-23 10:13:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#31 [2023-11-23 10:13:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#32 [2023-11-23 10:13:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#33 [2023-11-23 10:13:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#34 [2023-11-23 10:13:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#35 [2023-11-23 10:13:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#36 [2023-11-23 10:13:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#37 [2023-11-23 10:13:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#38 [2023-11-23 10:13:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#39 [2023-11-23 10:13:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#40 [2023-11-23 10:13:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#41 [2023-11-23 10:13:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#42 [2023-11-23 10:13:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#43 [2023-11-23 10:13:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#44 [2023-11-23 10:13:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#45 [2023-11-23 10:13:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2023-11-23 10:13:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2023-11-23 10:13:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2023-11-23 10:13:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2023-11-23 10:13:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2023-11-23 10:13:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2023-11-23 10:13:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2023-11-23 10:13:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2023-11-23 10:13:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2023-11-23 10:13:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2023-11-23 10:13:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2023-11-23 10:13:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2023-11-23 10:13:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2023-11-23 10:13:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2023-11-23 10:13:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2023-11-23 10:13:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2023-11-23 10:13:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2023-11-23 10:13:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2023-11-23 10:13:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2023-11-23 10:13:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2023-11-23 10:13:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2023-11-23 10:13:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2023-11-23 10:13:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2023-11-23 10:13:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2023-11-23 10:13:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#24 [2023-11-23 10:13:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#25 [2023-11-23 10:13:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#26 [2023-11-23 10:13:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#27 [2023-11-23 10:13:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#28 [2023-11-23 10:13:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#29 [2023-11-23 10:13:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#30 [2023-11-23 10:13:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#31 [2023-11-23 10:13:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#32 [2023-11-23 10:13:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#33 [2023-11-23 10:13:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#34 [2023-11-23 10:13:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#35 [2023-11-23 10:13:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#36 [2023-11-23 10:13:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#37 [2023-11-23 10:13:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#38 [2023-11-23 10:13:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#39 [2023-11-23 10:13:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#40 [2023-11-23 10:13:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#41 [2023-11-23 10:13:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#42 [2023-11-23 10:13:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#43 [2023-11-23 10:13:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#44 [2023-11-23 10:13:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#45 [2023-11-23 10:13:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-23 10:13:05,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-23 10:13:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-23 10:13:05,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-23 10:13:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_irq_itoa [2023-11-23 10:13:05,865 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_irq_itoa [2023-11-23 10:13:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_init [2023-11-23 10:13:05,865 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_init [2023-11-23 10:13:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_struct_atmdev_ops_io_instance_2 [2023-11-23 10:13:05,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_struct_atmdev_ops_io_instance_2 [2023-11-23 10:13:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_ack [2023-11-23 10:13:05,865 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_ack [2023-11-23 10:13:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_130 [2023-11-23 10:13:05,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_130 [2023-11-23 10:13:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2023-11-23 10:13:05,866 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2023-11-23 10:13:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2023-11-23 10:13:05,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2023-11-23 10:13:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure sk_atm [2023-11-23 10:13:05,866 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_atm [2023-11-23 10:13:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2023-11-23 10:13:05,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2023-11-23 10:13:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_prom_read [2023-11-23 10:13:05,866 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_prom_read [2023-11-23 10:13:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 10:13:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2023-11-23 10:13:05,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2023-11-23 10:13:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 10:13:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 10:13:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 10:13:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-23 10:13:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-23 10:13:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-23 10:13:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-23 10:13:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-11-23 10:13:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-11-23 10:13:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-11-23 10:13:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-11-23 10:13:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-11-23 10:13:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-11-23 10:13:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-11-23 10:13:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-11-23 10:13:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2023-11-23 10:13:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2023-11-23 10:13:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2023-11-23 10:13:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2023-11-23 10:13:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2023-11-23 10:13:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2023-11-23 10:13:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2023-11-23 10:13:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2023-11-23 10:13:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2023-11-23 10:13:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2023-11-23 10:13:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2023-11-23 10:13:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2023-11-23 10:13:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#27 [2023-11-23 10:13:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#28 [2023-11-23 10:13:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#29 [2023-11-23 10:13:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#30 [2023-11-23 10:13:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#31 [2023-11-23 10:13:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#32 [2023-11-23 10:13:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#33 [2023-11-23 10:13:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#34 [2023-11-23 10:13:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#35 [2023-11-23 10:13:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#36 [2023-11-23 10:13:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#37 [2023-11-23 10:13:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#38 [2023-11-23 10:13:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#39 [2023-11-23 10:13:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#40 [2023-11-23 10:13:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#41 [2023-11-23 10:13:05,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#42 [2023-11-23 10:13:05,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#43 [2023-11-23 10:13:05,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#44 [2023-11-23 10:13:05,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#45 [2023-11-23 10:13:05,871 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_cpu [2023-11-23 10:13:05,871 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_cpu [2023-11-23 10:13:05,871 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_reset [2023-11-23 10:13:05,871 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_reset [2023-11-23 10:13:05,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 10:13:05,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 10:13:05,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 10:13:05,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-23 10:13:05,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-23 10:13:05,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-23 10:13:05,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-23 10:13:05,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-11-23 10:13:05,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-11-23 10:13:05,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-11-23 10:13:05,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-11-23 10:13:05,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-11-23 10:13:05,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-11-23 10:13:05,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-11-23 10:13:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-11-23 10:13:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2023-11-23 10:13:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2023-11-23 10:13:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2023-11-23 10:13:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2023-11-23 10:13:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2023-11-23 10:13:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2023-11-23 10:13:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2023-11-23 10:13:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2023-11-23 10:13:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2023-11-23 10:13:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2023-11-23 10:13:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2023-11-23 10:13:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2023-11-23 10:13:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#27 [2023-11-23 10:13:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#28 [2023-11-23 10:13:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#29 [2023-11-23 10:13:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#30 [2023-11-23 10:13:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#31 [2023-11-23 10:13:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#32 [2023-11-23 10:13:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#33 [2023-11-23 10:13:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#34 [2023-11-23 10:13:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#35 [2023-11-23 10:13:05,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#36 [2023-11-23 10:13:05,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#37 [2023-11-23 10:13:05,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#38 [2023-11-23 10:13:05,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#39 [2023-11-23 10:13:05,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#40 [2023-11-23 10:13:05,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#41 [2023-11-23 10:13:05,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#42 [2023-11-23 10:13:05,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#43 [2023-11-23 10:13:05,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#44 [2023-11-23 10:13:05,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#45 [2023-11-23 10:13:05,876 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2023-11-23 10:13:05,876 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2023-11-23 10:13:05,876 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-23 10:13:05,876 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-23 10:13:05,876 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2023-11-23 10:13:05,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2023-11-23 10:13:05,876 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_byte [2023-11-23 10:13:05,876 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_byte [2023-11-23 10:13:05,876 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2023-11-23 10:13:05,876 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2023-11-23 10:13:05,876 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_chunk_free [2023-11-23 10:13:05,877 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_chunk_free [2023-11-23 10:13:05,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2023-11-23 10:13:05,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2023-11-23 10:13:05,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2023-11-23 10:13:05,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2023-11-23 10:13:05,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2023-11-23 10:13:05,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2023-11-23 10:13:05,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2023-11-23 10:13:05,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2023-11-23 10:13:05,878 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_map [2023-11-23 10:13:05,878 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_map [2023-11-23 10:13:05,878 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_atm2fore_aal [2023-11-23 10:13:05,878 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_atm2fore_aal [2023-11-23 10:13:05,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2023-11-23 10:13:05,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2023-11-23 10:13:05,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2023-11-23 10:13:05,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2023-11-23 10:13:05,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2023-11-23 10:13:05,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2023-11-23 10:13:05,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2023-11-23 10:13:05,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2023-11-23 10:13:05,879 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2023-11-23 10:13:05,879 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2023-11-23 10:13:05,879 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2023-11-23 10:13:05,879 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2023-11-23 10:13:05,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register_150 [2023-11-23 10:13:05,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register_150 [2023-11-23 10:13:05,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2023-11-23 10:13:05,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2023-11-23 10:13:05,879 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-23 10:13:05,880 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-23 10:13:05,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2023-11-23 10:13:05,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2023-11-23 10:13:05,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_register_8_1 [2023-11-23 10:13:05,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_register_8_1 [2023-11-23 10:13:05,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 10:13:05,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 10:13:05,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 10:13:05,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-23 10:13:05,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-23 10:13:05,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-23 10:13:05,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-23 10:13:05,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-23 10:13:05,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-11-23 10:13:05,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-11-23 10:13:05,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-11-23 10:13:05,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-11-23 10:13:05,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-11-23 10:13:05,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-11-23 10:13:05,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-11-23 10:13:05,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2023-11-23 10:13:05,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2023-11-23 10:13:05,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2023-11-23 10:13:05,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2023-11-23 10:13:05,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2023-11-23 10:13:05,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2023-11-23 10:13:05,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2023-11-23 10:13:05,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2023-11-23 10:13:05,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2023-11-23 10:13:05,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2023-11-23 10:13:05,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2023-11-23 10:13:05,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2023-11-23 10:13:05,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2023-11-23 10:13:05,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2023-11-23 10:13:05,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2023-11-23 10:13:05,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#30 [2023-11-23 10:13:05,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#31 [2023-11-23 10:13:05,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#32 [2023-11-23 10:13:05,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#33 [2023-11-23 10:13:05,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#34 [2023-11-23 10:13:05,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#35 [2023-11-23 10:13:05,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#36 [2023-11-23 10:13:05,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#37 [2023-11-23 10:13:05,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#38 [2023-11-23 10:13:05,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#39 [2023-11-23 10:13:05,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#40 [2023-11-23 10:13:05,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#41 [2023-11-23 10:13:05,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#42 [2023-11-23 10:13:05,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#43 [2023-11-23 10:13:05,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#44 [2023-11-23 10:13:05,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#45 [2023-11-23 10:13:05,884 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2023-11-23 10:13:05,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2023-11-23 10:13:05,885 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_configure [2023-11-23 10:13:05,885 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_configure [2023-11-23 10:13:05,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-23 10:13:05,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-23 10:13:05,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2023-11-23 10:13:05,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2023-11-23 10:13:05,885 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2023-11-23 10:13:05,885 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2023-11-23 10:13:05,885 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2023-11-23 10:13:05,886 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2023-11-23 10:13:05,886 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_send [2023-11-23 10:13:05,886 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_send [2023-11-23 10:13:05,886 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_unmap [2023-11-23 10:13:05,886 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_unmap [2023-11-23 10:13:05,886 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_alloc [2023-11-23 10:13:05,886 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_alloc [2023-11-23 10:13:05,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2023-11-23 10:13:05,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2023-11-23 10:13:05,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2023-11-23 10:13:05,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2023-11-23 10:13:05,887 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2023-11-23 10:13:05,887 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2023-11-23 10:13:05,887 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_proc_read [2023-11-23 10:13:05,887 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_proc_read [2023-11-23 10:13:05,887 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_poll [2023-11-23 10:13:05,887 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_poll [2023-11-23 10:13:05,887 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2023-11-23 10:13:05,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2023-11-23 10:13:05,887 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2023-11-23 10:13:05,887 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2023-11-23 10:13:05,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 10:13:05,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 10:13:05,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 10:13:05,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 10:13:05,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-23 10:13:05,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-23 10:13:05,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-23 10:13:05,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-23 10:13:05,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-23 10:13:05,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-11-23 10:13:05,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-11-23 10:13:05,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-11-23 10:13:05,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-11-23 10:13:05,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-11-23 10:13:05,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-11-23 10:13:05,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2023-11-23 10:13:05,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2023-11-23 10:13:05,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2023-11-23 10:13:05,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2023-11-23 10:13:05,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2023-11-23 10:13:05,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2023-11-23 10:13:05,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2023-11-23 10:13:05,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2023-11-23 10:13:05,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2023-11-23 10:13:05,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2023-11-23 10:13:05,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2023-11-23 10:13:05,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2023-11-23 10:13:05,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2023-11-23 10:13:05,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2023-11-23 10:13:05,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2023-11-23 10:13:05,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#30 [2023-11-23 10:13:05,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#31 [2023-11-23 10:13:05,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#32 [2023-11-23 10:13:05,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#33 [2023-11-23 10:13:05,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#34 [2023-11-23 10:13:05,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#35 [2023-11-23 10:13:05,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#36 [2023-11-23 10:13:05,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#37 [2023-11-23 10:13:05,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#38 [2023-11-23 10:13:05,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#39 [2023-11-23 10:13:05,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#40 [2023-11-23 10:13:05,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#41 [2023-11-23 10:13:05,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#42 [2023-11-23 10:13:05,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#43 [2023-11-23 10:13:05,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#44 [2023-11-23 10:13:05,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#45 [2023-11-23 10:13:05,892 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2023-11-23 10:13:05,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2023-11-23 10:13:05,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2023-11-23 10:13:05,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2023-11-23 10:13:05,892 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_tx_irq [2023-11-23 10:13:05,892 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_tx_irq [2023-11-23 10:13:06,802 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 10:13:06,805 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 10:13:10,561 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-23 10:13:13,803 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 10:13:14,033 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 10:13:14,033 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-23 10:13:14,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:14 BoogieIcfgContainer [2023-11-23 10:13:14,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 10:13:14,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 10:13:14,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 10:13:14,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 10:13:14,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:12:59" (1/3) ... [2023-11-23 10:13:14,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b9fe7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:14, skipping insertion in model container [2023-11-23 10:13:14,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:04" (2/3) ... [2023-11-23 10:13:14,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b9fe7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:14, skipping insertion in model container [2023-11-23 10:13:14,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:14" (3/3) ... [2023-11-23 10:13:14,043 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2023-11-23 10:13:14,058 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 10:13:14,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-11-23 10:13:14,114 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 10:13:14,119 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;@4e2cb7ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 10:13:14,119 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2023-11-23 10:13:14,128 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:13:14,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-23 10:13:14,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:13:14,136 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:13:14,137 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:13:14,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:13:14,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1647314516, now seen corresponding path program 1 times [2023-11-23 10:13:14,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:13:14,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847323405] [2023-11-23 10:13:14,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:13:14,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:13:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:15,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:13:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:15,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:13:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:15,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:13:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:15,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:13:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:15,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:13:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:15,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:13:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:15,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:13:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:15,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:13:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:15,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:13:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:15,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:13:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:15,239 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:13:15,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:13:15,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847323405] [2023-11-23 10:13:15,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847323405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:13:15,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:13:15,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:13:15,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872940881] [2023-11-23 10:13:15,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:13:15,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:13:15,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:13:15,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:13:15,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:13:15,275 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:13:17,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:13:26,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:13:26,960 INFO L93 Difference]: Finished difference Result 5427 states and 8116 transitions. [2023-11-23 10:13:26,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 10:13:26,963 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:13:26,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:13:27,000 INFO L225 Difference]: With dead ends: 5427 [2023-11-23 10:13:27,000 INFO L226 Difference]: Without dead ends: 3600 [2023-11-23 10:13:27,015 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:13:27,018 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 6856 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 7523 mSolverCounterSat, 4689 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6941 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 12212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4689 IncrementalHoareTripleChecker+Valid, 7523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2023-11-23 10:13:27,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6941 Valid, 948 Invalid, 12212 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4689 Valid, 7523 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2023-11-23 10:13:27,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3600 states. [2023-11-23 10:13:27,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3600 to 3426. [2023-11-23 10:13:27,309 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:13:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3426 states to 3426 states and 4907 transitions. [2023-11-23 10:13:27,344 INFO L78 Accepts]: Start accepts. Automaton has 3426 states and 4907 transitions. Word has length 51 [2023-11-23 10:13:27,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:13:27,345 INFO L495 AbstractCegarLoop]: Abstraction has 3426 states and 4907 transitions. [2023-11-23 10:13:27,345 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:13:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3426 states and 4907 transitions. [2023-11-23 10:13:27,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-23 10:13:27,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:13:27,349 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:13:27,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 10:13:27,349 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:13:27,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:13:27,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1676510315, now seen corresponding path program 1 times [2023-11-23 10:13:27,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:13:27,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076540507] [2023-11-23 10:13:27,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:13:27,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:13:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:27,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:13:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:27,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:13:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:27,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:13:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:27,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:13:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:27,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:13:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:27,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:13:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:27,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:13:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:27,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:13:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:27,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:13:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:27,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:13:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:27,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:13:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:27,912 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:13:27,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:13:27,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076540507] [2023-11-23 10:13:27,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076540507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:13:27,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:13:27,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:13:27,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775118967] [2023-11-23 10:13:27,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:13:27,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:13:27,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:13:27,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:13:27,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:13:27,916 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:13:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:13:35,092 INFO L93 Difference]: Finished difference Result 3426 states and 4907 transitions. [2023-11-23 10:13:35,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:13:35,093 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:13:35,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:13:35,109 INFO L225 Difference]: With dead ends: 3426 [2023-11-23 10:13:35,109 INFO L226 Difference]: Without dead ends: 3424 [2023-11-23 10:13:35,113 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:13:35,114 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 4246 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 4879 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4335 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 7689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2810 IncrementalHoareTripleChecker+Valid, 4879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-11-23 10:13:35,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4335 Valid, 665 Invalid, 7689 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2810 Valid, 4879 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2023-11-23 10:13:35,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3424 states. [2023-11-23 10:13:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3424 to 3424. [2023-11-23 10:13:35,276 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:13:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3424 states to 3424 states and 4905 transitions. [2023-11-23 10:13:35,292 INFO L78 Accepts]: Start accepts. Automaton has 3424 states and 4905 transitions. Word has length 56 [2023-11-23 10:13:35,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:13:35,292 INFO L495 AbstractCegarLoop]: Abstraction has 3424 states and 4905 transitions. [2023-11-23 10:13:35,292 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:13:35,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3424 states and 4905 transitions. [2023-11-23 10:13:35,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-23 10:13:35,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:13:35,294 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:13:35,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 10:13:35,295 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:13:35,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:13:35,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1618725992, now seen corresponding path program 1 times [2023-11-23 10:13:35,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:13:35,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916669426] [2023-11-23 10:13:35,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:13:35,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:13:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:35,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:13:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:35,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:13:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:35,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:13:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:35,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:13:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:35,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:13:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:35,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:13:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:35,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:13:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:35,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:13:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:35,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:13:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:35,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:13:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:35,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:13:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:35,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:13:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:35,835 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:13:35,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:13:35,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916669426] [2023-11-23 10:13:35,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916669426] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:13:35,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:13:35,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:13:35,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273959649] [2023-11-23 10:13:35,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:13:35,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:13:35,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:13:35,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:13:35,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:13:35,838 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:13:45,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:13:45,287 INFO L93 Difference]: Finished difference Result 3424 states and 4905 transitions. [2023-11-23 10:13:45,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:13:45,289 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:13:45,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:13:45,305 INFO L225 Difference]: With dead ends: 3424 [2023-11-23 10:13:45,305 INFO L226 Difference]: Without dead ends: 3422 [2023-11-23 10:13:45,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-23 10:13:45,312 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 4240 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 4875 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s 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, 9.2s IncrementalHoareTripleChecker+Time [2023-11-23 10:13:45,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4328 Valid, 665 Invalid, 7685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4875 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2023-11-23 10:13:45,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2023-11-23 10:13:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 3422. [2023-11-23 10:13:45,442 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:13:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 4903 transitions. [2023-11-23 10:13:45,455 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 4903 transitions. Word has length 61 [2023-11-23 10:13:45,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:13:45,456 INFO L495 AbstractCegarLoop]: Abstraction has 3422 states and 4903 transitions. [2023-11-23 10:13:45,456 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:13:45,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 4903 transitions. [2023-11-23 10:13:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-23 10:13:45,460 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:13:45,461 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:13:45,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 10:13:45,461 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:13:45,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:13:45,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1343801856, now seen corresponding path program 1 times [2023-11-23 10:13:45,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:13:45,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247731873] [2023-11-23 10:13:45,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:13:45,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:13:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:45,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:13:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:45,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:13:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:45,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:13:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:45,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:13:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:45,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:13:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:45,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:13:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:45,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:13:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:46,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:13:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:46,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:13:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:46,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:13:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:46,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:13:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:46,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:13:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:46,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:13:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:46,066 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:13:46,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:13:46,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247731873] [2023-11-23 10:13:46,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247731873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:13:46,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:13:46,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:13:46,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558476820] [2023-11-23 10:13:46,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:13:46,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:13:46,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:13:46,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:13:46,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:13:46,068 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:13:47,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:13:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:13:54,246 INFO L93 Difference]: Finished difference Result 3422 states and 4903 transitions. [2023-11-23 10:13:54,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:13:54,247 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:13:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:13:54,268 INFO L225 Difference]: With dead ends: 3422 [2023-11-23 10:13:54,268 INFO L226 Difference]: Without dead ends: 3420 [2023-11-23 10:13:54,270 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:13:54,271 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 4234 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 4871 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s 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.9s IncrementalHoareTripleChecker+Time [2023-11-23 10:13:54,273 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.9s Time] [2023-11-23 10:13:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3420 states. [2023-11-23 10:13:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3420 to 3420. [2023-11-23 10:13:54,583 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:13:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3420 states to 3420 states and 4901 transitions. [2023-11-23 10:13:54,599 INFO L78 Accepts]: Start accepts. Automaton has 3420 states and 4901 transitions. Word has length 66 [2023-11-23 10:13:54,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:13:54,600 INFO L495 AbstractCegarLoop]: Abstraction has 3420 states and 4901 transitions. [2023-11-23 10:13:54,601 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:13:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3420 states and 4901 transitions. [2023-11-23 10:13:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-23 10:13:54,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:13:54,618 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:13:54,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 10:13:54,618 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, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:13:54,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:13:54,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1007850981, now seen corresponding path program 1 times [2023-11-23 10:13:54,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:13:54,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468757062] [2023-11-23 10:13:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:13:54,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:13:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:55,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:13:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:55,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:13:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:55,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:13:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:55,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:13:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:55,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:13:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:55,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:13:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:55,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:13:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:55,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:13:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:55,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:13:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:55,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:13:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:55,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:13:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:55,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:13:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:55,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:13:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:55,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:13:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:13:55,125 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:13:55,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:13:55,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468757062] [2023-11-23 10:13:55,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468757062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:13:55,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:13:55,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:13:55,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723532057] [2023-11-23 10:13:55,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:13:55,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:13:55,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:13:55,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:13:55,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:13:55,128 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:14:02,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:14:02,799 INFO L93 Difference]: Finished difference Result 3420 states and 4901 transitions. [2023-11-23 10:14:02,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:14:02,800 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:14:02,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:14:02,813 INFO L225 Difference]: With dead ends: 3420 [2023-11-23 10:14:02,813 INFO L226 Difference]: Without dead ends: 3418 [2023-11-23 10:14:02,815 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:14:02,816 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 4228 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 4867 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s 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, 7.4s IncrementalHoareTripleChecker+Time [2023-11-23 10:14:02,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4314 Valid, 665 Invalid, 7677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4867 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2023-11-23 10:14:02,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2023-11-23 10:14:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 3418. [2023-11-23 10:14:03,178 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:14:03,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 4899 transitions. [2023-11-23 10:14:03,195 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 4899 transitions. Word has length 71 [2023-11-23 10:14:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:14:03,195 INFO L495 AbstractCegarLoop]: Abstraction has 3418 states and 4899 transitions. [2023-11-23 10:14:03,196 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:14:03,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 4899 transitions. [2023-11-23 10:14:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 10:14:03,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:14:03,198 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:14:03,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 10:14:03,198 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:14:03,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:14:03,199 INFO L85 PathProgramCache]: Analyzing trace with hash -174589325, now seen corresponding path program 1 times [2023-11-23 10:14:03,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:14:03,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738900810] [2023-11-23 10:14:03,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:14:03,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:14:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:04,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:14:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:04,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:14:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:04,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:14:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:04,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:14:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:04,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:14:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:04,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:14:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:04,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:14:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:04,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:14:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:04,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:14:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:04,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:14:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:04,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 10:14:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:04,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:14:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:04,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:14:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:04,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:14:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:04,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:14:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:04,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 10:14:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:04,906 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:14:04,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:14:04,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738900810] [2023-11-23 10:14:04,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738900810] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 10:14:04,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104017315] [2023-11-23 10:14:04,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:14:04,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:14:04,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:14:04,909 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:14:04,953 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:14:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:06,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 1918 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-23 10:14:06,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 10:14:06,322 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:14:06,322 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 10:14:06,490 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:14:06,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104017315] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 10:14:06,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 10:14:06,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 22 [2023-11-23 10:14:06,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009500070] [2023-11-23 10:14:06,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 10:14:06,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-23 10:14:06,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:14:06,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-23 10:14:06,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2023-11-23 10:14:06,493 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:14:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:14:34,709 INFO L93 Difference]: Finished difference Result 4386 states and 6213 transitions. [2023-11-23 10:14:34,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-23 10:14:34,709 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:14:34,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:14:34,725 INFO L225 Difference]: With dead ends: 4386 [2023-11-23 10:14:34,725 INFO L226 Difference]: Without dead ends: 3619 [2023-11-23 10:14:34,728 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:14:34,729 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 3360 mSDsluCounter, 2542 mSDsCounter, 0 mSdLazyCounter, 32262 mSolverCounterSat, 2852 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3379 SdHoareTripleChecker+Valid, 2823 SdHoareTripleChecker+Invalid, 35114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2852 IncrementalHoareTripleChecker+Valid, 32262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2023-11-23 10:14:34,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3379 Valid, 2823 Invalid, 35114 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2852 Valid, 32262 Invalid, 0 Unknown, 0 Unchecked, 27.5s Time] [2023-11-23 10:14:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3619 states. [2023-11-23 10:14:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3619 to 3445. [2023-11-23 10:14:34,881 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:14:34,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 4941 transitions. [2023-11-23 10:14:34,892 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 4941 transitions. Word has length 79 [2023-11-23 10:14:34,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:14:34,892 INFO L495 AbstractCegarLoop]: Abstraction has 3445 states and 4941 transitions. [2023-11-23 10:14:34,892 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:14:34,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 4941 transitions. [2023-11-23 10:14:34,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-23 10:14:34,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:14:34,893 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:14:34,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 10:14:35,110 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:14:35,111 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, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:14:35,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:14:35,112 INFO L85 PathProgramCache]: Analyzing trace with hash -776676444, now seen corresponding path program 1 times [2023-11-23 10:14:35,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:14:35,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164043581] [2023-11-23 10:14:35,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:14:35,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:14:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:35,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:14:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:35,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:14:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:35,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:14:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:35,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:14:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:35,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:14:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:35,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:14:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:35,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:14:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:35,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:14:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:35,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:14:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:35,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:14:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:35,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:14:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:35,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:14:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:35,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:14:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:35,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:14:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:35,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:14:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:35,490 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:14:35,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:14:35,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164043581] [2023-11-23 10:14:35,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164043581] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:14:35,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:14:35,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:14:35,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317428981] [2023-11-23 10:14:35,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:14:35,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:14:35,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:14:35,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:14:35,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:14:35,492 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:14:37,996 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:14:44,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:14:44,023 INFO L93 Difference]: Finished difference Result 3445 states and 4941 transitions. [2023-11-23 10:14:44,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:14:44,024 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:14:44,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:14:44,037 INFO L225 Difference]: With dead ends: 3445 [2023-11-23 10:14:44,038 INFO L226 Difference]: Without dead ends: 3443 [2023-11-23 10:14:44,039 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:14:44,040 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 4222 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 4862 mSolverCounterSat, 2810 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4307 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 7673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2810 IncrementalHoareTripleChecker+Valid, 4862 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-11-23 10:14:44,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4307 Valid, 665 Invalid, 7673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4862 Invalid, 1 Unknown, 0 Unchecked, 8.3s Time] [2023-11-23 10:14:44,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2023-11-23 10:14:44,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 3443. [2023-11-23 10:14:44,180 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:14:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 4939 transitions. [2023-11-23 10:14:44,191 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 4939 transitions. Word has length 76 [2023-11-23 10:14:44,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:14:44,191 INFO L495 AbstractCegarLoop]: Abstraction has 3443 states and 4939 transitions. [2023-11-23 10:14:44,192 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:14:44,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 4939 transitions. [2023-11-23 10:14:44,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-23 10:14:44,192 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:14:44,193 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:14:44,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 10:14:44,193 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:14:44,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:14:44,193 INFO L85 PathProgramCache]: Analyzing trace with hash -475339504, now seen corresponding path program 1 times [2023-11-23 10:14:44,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:14:44,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138727094] [2023-11-23 10:14:44,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:14:44,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:14:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:14:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:14:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:14:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:14:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 10:14:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:14:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:14:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:14:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 10:14:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:14:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:14:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:14:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 10:14:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:14:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:14:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:14:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:14:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:14:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 10:14:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 10:14:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:44,635 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:14:44,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:14:44,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138727094] [2023-11-23 10:14:44,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138727094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:14:44,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:14:44,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 10:14:44,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029125928] [2023-11-23 10:14:44,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:14:44,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 10:14:44,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:14:44,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 10:14:44,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 10:14:44,637 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:14:53,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:14:53,136 INFO L93 Difference]: Finished difference Result 7074 states and 10226 transitions. [2023-11-23 10:14:53,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:14:53,136 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:14:53,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:14:53,168 INFO L225 Difference]: With dead ends: 7074 [2023-11-23 10:14:53,168 INFO L226 Difference]: Without dead ends: 3660 [2023-11-23 10:14:53,183 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:14:53,185 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 5536 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 4141 mSolverCounterSat, 4367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5637 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 8508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4367 IncrementalHoareTripleChecker+Valid, 4141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2023-11-23 10:14:53,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5637 Valid, 439 Invalid, 8508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4367 Valid, 4141 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2023-11-23 10:14:53,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2023-11-23 10:14:53,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3443. [2023-11-23 10:14:53,384 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:14:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 4945 transitions. [2023-11-23 10:14:53,396 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 4945 transitions. Word has length 93 [2023-11-23 10:14:53,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:14:53,400 INFO L495 AbstractCegarLoop]: Abstraction has 3443 states and 4945 transitions. [2023-11-23 10:14:53,400 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:14:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 4945 transitions. [2023-11-23 10:14:53,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 10:14:53,402 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:14:53,402 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:14:53,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 10:14:53,403 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:14:53,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:14:53,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1356999615, now seen corresponding path program 1 times [2023-11-23 10:14:53,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:14:53,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859158748] [2023-11-23 10:14:53,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:14:53,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:14:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:53,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:14:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:53,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:14:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:53,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:14:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:53,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:14:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:53,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:14:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:53,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:14:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:53,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:14:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:53,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:14:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:53,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:14:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:53,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:14:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:53,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:14:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:53,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:14:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:53,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:14:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:53,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:14:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:53,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:14:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:53,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:14:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:14:53,876 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:14:53,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:14:53,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859158748] [2023-11-23 10:14:53,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859158748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:14:53,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:14:53,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:14:53,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187258015] [2023-11-23 10:14:53,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:14:53,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:14:53,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:14:53,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:14:53,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:14:53,879 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:14:55,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:15:00,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:15:00,923 INFO L93 Difference]: Finished difference Result 3443 states and 4945 transitions. [2023-11-23 10:15:00,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:15:00,923 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:15:00,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:15:00,939 INFO L225 Difference]: With dead ends: 3443 [2023-11-23 10:15:00,939 INFO L226 Difference]: Without dead ends: 3441 [2023-11-23 10:15:00,941 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:15:00,943 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 4211 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 4858 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s 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, 6.8s IncrementalHoareTripleChecker+Time [2023-11-23 10:15:00,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4295 Valid, 646 Invalid, 7668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4858 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2023-11-23 10:15:00,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2023-11-23 10:15:01,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 3441. [2023-11-23 10:15:01,171 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:15:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 3441 states and 4943 transitions. [2023-11-23 10:15:01,180 INFO L78 Accepts]: Start accepts. Automaton has 3441 states and 4943 transitions. Word has length 81 [2023-11-23 10:15:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:15:01,181 INFO L495 AbstractCegarLoop]: Abstraction has 3441 states and 4943 transitions. [2023-11-23 10:15:01,181 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:15:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 4943 transitions. [2023-11-23 10:15:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-23 10:15:01,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:15:01,182 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:15:01,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 10:15:01,182 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:15:01,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:15:01,182 INFO L85 PathProgramCache]: Analyzing trace with hash -683172525, now seen corresponding path program 1 times [2023-11-23 10:15:01,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:15:01,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105174040] [2023-11-23 10:15:01,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:15:01,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:15:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:15:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:15:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:15:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 10:15:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:15:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:15:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 10:15:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:15:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:15:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 10:15:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:15:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:15:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:15:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:15:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 10:15:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 10:15:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 10:15:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:01,690 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:15:01,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:15:01,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105174040] [2023-11-23 10:15:01,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105174040] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 10:15:01,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352152607] [2023-11-23 10:15:01,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:15:01,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:15:01,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:15:01,709 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:15:01,776 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:15:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:03,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 2097 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 10:15:03,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 10:15:03,037 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:15:03,037 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 10:15:03,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352152607] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:15:03,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 10:15:03,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-23 10:15:03,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281920102] [2023-11-23 10:15:03,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:15:03,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 10:15:03,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:15:03,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 10:15:03,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-23 10:15:03,039 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:15:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:15:04,203 INFO L93 Difference]: Finished difference Result 6847 states and 9835 transitions. [2023-11-23 10:15:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 10:15:04,204 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:15:04,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:15:04,216 INFO L225 Difference]: With dead ends: 6847 [2023-11-23 10:15:04,216 INFO L226 Difference]: Without dead ends: 3435 [2023-11-23 10:15:04,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-23 10:15:04,226 INFO L413 NwaCegarLoop]: 2300 mSDtfsCounter, 2508 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 10:15:04,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2508 Valid, 2300 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 10:15:04,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2023-11-23 10:15:04,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3435. [2023-11-23 10:15:04,414 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:15:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 4934 transitions. [2023-11-23 10:15:04,425 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 4934 transitions. Word has length 98 [2023-11-23 10:15:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:15:04,426 INFO L495 AbstractCegarLoop]: Abstraction has 3435 states and 4934 transitions. [2023-11-23 10:15:04,426 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:15:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 4934 transitions. [2023-11-23 10:15:04,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-23 10:15:04,428 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:15:04,428 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:15:04,457 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:15:04,648 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:15:04,648 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, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:15:04,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:15:04,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1914980385, now seen corresponding path program 1 times [2023-11-23 10:15:04,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:15:04,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335877226] [2023-11-23 10:15:04,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:15:04,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:15:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:04,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:04,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:15:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:04,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:15:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:04,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:15:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:04,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:15:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:05,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:15:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:05,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:15:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:05,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:05,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:15:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:05,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:15:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:05,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:15:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:05,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:15:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:15:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:05,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:15:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:05,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:15:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:05,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:15:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:05,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:15:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:05,079 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:15:05,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:15:05,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335877226] [2023-11-23 10:15:05,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335877226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:15:05,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:15:05,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:15:05,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904632134] [2023-11-23 10:15:05,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:15:05,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:15:05,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:15:05,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:15:05,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:15:05,081 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:15:12,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:15:12,116 INFO L93 Difference]: Finished difference Result 3435 states and 4934 transitions. [2023-11-23 10:15:12,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:15:12,117 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:15:12,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:15:12,128 INFO L225 Difference]: With dead ends: 3435 [2023-11-23 10:15:12,128 INFO L226 Difference]: Without dead ends: 3433 [2023-11-23 10:15:12,131 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:15:12,131 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4200 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 4853 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s 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:15:12,132 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:15:12,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2023-11-23 10:15:12,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3433. [2023-11-23 10:15:12,438 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:15:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 4932 transitions. [2023-11-23 10:15:12,449 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 4932 transitions. Word has length 86 [2023-11-23 10:15:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:15:12,449 INFO L495 AbstractCegarLoop]: Abstraction has 3433 states and 4932 transitions. [2023-11-23 10:15:12,449 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:15:12,450 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 4932 transitions. [2023-11-23 10:15:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-23 10:15:12,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:15:12,450 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:15:12,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 10:15:12,451 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:15:12,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:15:12,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1016800709, now seen corresponding path program 1 times [2023-11-23 10:15:12,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:15:12,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231903471] [2023-11-23 10:15:12,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:15:12,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:15:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:15:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:15:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:15:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 10:15:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:15:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:15:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 10:15:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:15:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:15:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 10:15:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:15:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:15:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:15:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:15:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 10:15:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 10:15:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:12,843 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:15:12,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:15:12,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231903471] [2023-11-23 10:15:12,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231903471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:15:12,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:15:12,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 10:15:12,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472957785] [2023-11-23 10:15:12,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:15:12,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 10:15:12,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:15:12,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 10:15:12,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 10:15:12,846 INFO L87 Difference]: Start difference. First operand 3433 states and 4932 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 4 states have internal predecessors, (36), 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:15:15,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:15:16,739 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:15:25,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:15:25,828 INFO L93 Difference]: Finished difference Result 6995 states and 10151 transitions. [2023-11-23 10:15:25,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 10:15:25,828 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), 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 102 [2023-11-23 10:15:25,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:15:25,838 INFO L225 Difference]: With dead ends: 6995 [2023-11-23 10:15:25,838 INFO L226 Difference]: Without dead ends: 3591 [2023-11-23 10:15:25,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-11-23 10:15:25,847 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 3320 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 8629 mSolverCounterSat, 2708 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3320 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 11338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2708 IncrementalHoareTripleChecker+Valid, 8629 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2023-11-23 10:15:25,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3320 Valid, 889 Invalid, 11338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2708 Valid, 8629 Invalid, 1 Unknown, 0 Unchecked, 12.5s Time] [2023-11-23 10:15:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2023-11-23 10:15:26,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 3437. [2023-11-23 10:15:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3437 states, 2149 states have (on average 1.31177291763611) internal successors, (2819), 2259 states have internal predecessors, (2819), 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:15:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 4936 transitions. [2023-11-23 10:15:26,067 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 4936 transitions. Word has length 102 [2023-11-23 10:15:26,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:15:26,068 INFO L495 AbstractCegarLoop]: Abstraction has 3437 states and 4936 transitions. [2023-11-23 10:15:26,068 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), 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:15:26,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 4936 transitions. [2023-11-23 10:15:26,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-23 10:15:26,069 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:15:26,069 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:15:26,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 10:15:26,069 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:15:26,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:15:26,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2049897758, now seen corresponding path program 1 times [2023-11-23 10:15:26,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:15:26,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484020265] [2023-11-23 10:15:26,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:15:26,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:15:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:15:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:15:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:15:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:15:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:15:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:15:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:15:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:15:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:15:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:15:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:15:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:15:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:15:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:15:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:15:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:26,514 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:15:26,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:15:26,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484020265] [2023-11-23 10:15:26,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484020265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:15:26,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:15:26,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:15:26,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484232866] [2023-11-23 10:15:26,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:15:26,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:15:26,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:15:26,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:15:26,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:15:26,515 INFO L87 Difference]: Start difference. First operand 3437 states and 4936 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:15:29,882 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:15:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:15:35,407 INFO L93 Difference]: Finished difference Result 3437 states and 4936 transitions. [2023-11-23 10:15:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:15:35,408 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:15:35,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:15:35,417 INFO L225 Difference]: With dead ends: 3437 [2023-11-23 10:15:35,417 INFO L226 Difference]: Without dead ends: 3435 [2023-11-23 10:15:35,419 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:15:35,419 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4192 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 4849 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s 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, 8.5s IncrementalHoareTripleChecker+Time [2023-11-23 10:15:35,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4275 Valid, 627 Invalid, 7659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4849 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2023-11-23 10:15:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2023-11-23 10:15:35,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3435. [2023-11-23 10:15:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3435 states, 2148 states have (on average 1.3114525139664805) 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:15:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 4934 transitions. [2023-11-23 10:15:35,642 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 4934 transitions. Word has length 88 [2023-11-23 10:15:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:15:35,643 INFO L495 AbstractCegarLoop]: Abstraction has 3435 states and 4934 transitions. [2023-11-23 10:15:35,643 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:15:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 4934 transitions. [2023-11-23 10:15:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-23 10:15:35,644 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:15:35,644 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] [2023-11-23 10:15:35,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 10:15:35,644 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:15:35,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:15:35,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1465712609, now seen corresponding path program 1 times [2023-11-23 10:15:35,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:15:35,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727134758] [2023-11-23 10:15:35,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:15:35,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:15:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:15:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:15:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:15:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 10:15:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:15:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:15:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 10:15:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:15:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:15:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 10:15:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:15:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:15:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:15:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:15:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 10:15:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-23 10:15:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:36,207 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:15:36,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:15:36,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727134758] [2023-11-23 10:15:36,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727134758] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:15:36,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:15:36,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 10:15:36,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807810318] [2023-11-23 10:15:36,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:15:36,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 10:15:36,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:15:36,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 10:15:36,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 10:15:36,213 INFO L87 Difference]: Start difference. First operand 3435 states and 4934 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 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:15:37,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:15:39,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:15:40,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:15:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:15:52,689 INFO L93 Difference]: Finished difference Result 8205 states and 11799 transitions. [2023-11-23 10:15:52,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 10:15:52,689 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 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 104 [2023-11-23 10:15:52,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:15:52,704 INFO L225 Difference]: With dead ends: 8205 [2023-11-23 10:15:52,705 INFO L226 Difference]: Without dead ends: 4799 [2023-11-23 10:15:52,716 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:15:52,716 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 6140 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 11876 mSolverCounterSat, 4464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6232 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 16340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4464 IncrementalHoareTripleChecker+Valid, 11876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2023-11-23 10:15:52,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6232 Valid, 970 Invalid, 16340 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4464 Valid, 11876 Invalid, 0 Unknown, 0 Unchecked, 15.8s Time] [2023-11-23 10:15:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4799 states. [2023-11-23 10:15:53,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4799 to 4529. [2023-11-23 10:15:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4529 states, 2831 states have (on average 1.305898975626987) internal successors, (3697), 2972 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:15:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4529 states to 4529 states and 6388 transitions. [2023-11-23 10:15:53,086 INFO L78 Accepts]: Start accepts. Automaton has 4529 states and 6388 transitions. Word has length 104 [2023-11-23 10:15:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:15:53,086 INFO L495 AbstractCegarLoop]: Abstraction has 4529 states and 6388 transitions. [2023-11-23 10:15:53,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 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:15:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4529 states and 6388 transitions. [2023-11-23 10:15:53,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-23 10:15:53,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:15:53,087 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] [2023-11-23 10:15:53,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 10:15:53,088 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:15:53,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:15:53,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1465653027, now seen corresponding path program 1 times [2023-11-23 10:15:53,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:15:53,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352641624] [2023-11-23 10:15:53,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:15:53,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:15:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:15:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:15:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:15:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 10:15:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:15:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:15:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 10:15:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:15:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:15:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 10:15:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:15:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:15:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:15:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:15:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:15:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 10:15:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-23 10:15:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:15:53,494 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:15:53,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:15:53,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352641624] [2023-11-23 10:15:53,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352641624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:15:53,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:15:53,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 10:15:53,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820255176] [2023-11-23 10:15:53,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:15:53,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 10:15:53,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:15:53,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 10:15:53,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 10:15:53,496 INFO L87 Difference]: Start difference. First operand 4529 states and 6388 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 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:15:56,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:16:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:16:04,660 INFO L93 Difference]: Finished difference Result 4793 states and 6816 transitions. [2023-11-23 10:16:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 10:16:04,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 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 104 [2023-11-23 10:16:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:16:04,676 INFO L225 Difference]: With dead ends: 4793 [2023-11-23 10:16:04,676 INFO L226 Difference]: Without dead ends: 4791 [2023-11-23 10:16:04,678 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:16:04,679 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 3334 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 8566 mSolverCounterSat, 2728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3334 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 11294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2728 IncrementalHoareTripleChecker+Valid, 8566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2023-11-23 10:16:04,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3334 Valid, 888 Invalid, 11294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2728 Valid, 8566 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2023-11-23 10:16:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4791 states. [2023-11-23 10:16:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4791 to 4533. [2023-11-23 10:16:04,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4533 states, 2835 states have (on average 1.3047619047619048) internal successors, (3699), 2976 states have internal predecessors, (3699), 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:16:04,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4533 states to 4533 states and 6390 transitions. [2023-11-23 10:16:04,990 INFO L78 Accepts]: Start accepts. Automaton has 4533 states and 6390 transitions. Word has length 104 [2023-11-23 10:16:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:16:04,991 INFO L495 AbstractCegarLoop]: Abstraction has 4533 states and 6390 transitions. [2023-11-23 10:16:04,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 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:16:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 4533 states and 6390 transitions. [2023-11-23 10:16:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-23 10:16:04,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:16:04,993 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:16:04,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 10:16:04,994 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:16:04,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:16:04,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1712226808, now seen corresponding path program 1 times [2023-11-23 10:16:04,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:16:04,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780321969] [2023-11-23 10:16:04,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:16:04,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:16:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:16:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:16:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:16:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:16:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:16:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:16:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:16:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:16:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:16:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:16:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:16:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:16:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:16:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:16:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:16:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:16:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:16:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 10:16:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:05,408 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:16:05,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:16:05,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780321969] [2023-11-23 10:16:05,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780321969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:16:05,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:16:05,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:16:05,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528909906] [2023-11-23 10:16:05,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:16:05,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:16:05,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:16:05,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:16:05,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:16:05,410 INFO L87 Difference]: Start difference. First operand 4533 states and 6390 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:16:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:16:13,248 INFO L93 Difference]: Finished difference Result 4533 states and 6390 transitions. [2023-11-23 10:16:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:16:13,249 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:16:13,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:16:13,258 INFO L225 Difference]: With dead ends: 4533 [2023-11-23 10:16:13,258 INFO L226 Difference]: Without dead ends: 4531 [2023-11-23 10:16:13,259 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:16:13,259 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4188 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 4845 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4270 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 7655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2810 IncrementalHoareTripleChecker+Valid, 4845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-11-23 10:16:13,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4270 Valid, 627 Invalid, 7655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4845 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2023-11-23 10:16:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2023-11-23 10:16:13,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4531. [2023-11-23 10:16:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4531 states, 2834 states have (on average 1.3045165843330981) 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:16:13,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 6388 transitions. [2023-11-23 10:16:13,561 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 6388 transitions. Word has length 93 [2023-11-23 10:16:13,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:16:13,562 INFO L495 AbstractCegarLoop]: Abstraction has 4531 states and 6388 transitions. [2023-11-23 10:16:13,563 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:16:13,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 6388 transitions. [2023-11-23 10:16:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 10:16:13,565 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:16:13,565 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, 1, 1] [2023-11-23 10:16:13,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 10:16:13,566 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:16:13,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:16:13,566 INFO L85 PathProgramCache]: Analyzing trace with hash -489758632, now seen corresponding path program 1 times [2023-11-23 10:16:13,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:16:13,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026572694] [2023-11-23 10:16:13,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:16:13,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:16:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:16:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:16:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:16:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:16:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 10:16:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:16:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:16:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:16:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 10:16:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:16:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:16:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:16:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 10:16:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:16:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 10:16:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:16:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:16:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:16:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 10:16:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-23 10:16:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:13,948 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:16:13,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:16:13,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026572694] [2023-11-23 10:16:13,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026572694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:16:13,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:16:13,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:16:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950344574] [2023-11-23 10:16:13,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:16:13,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:16:13,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:16:13,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:16:13,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:16:13,952 INFO L87 Difference]: Start difference. First operand 4531 states and 6388 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 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:16:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:16:22,122 INFO L93 Difference]: Finished difference Result 9279 states and 13239 transitions. [2023-11-23 10:16:22,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:16:22,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 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 107 [2023-11-23 10:16:22,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:16:22,134 INFO L225 Difference]: With dead ends: 9279 [2023-11-23 10:16:22,134 INFO L226 Difference]: Without dead ends: 4777 [2023-11-23 10:16:22,146 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:16:22,147 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4866 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 3879 mSolverCounterSat, 3641 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4960 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 7520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3641 IncrementalHoareTripleChecker+Valid, 3879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-11-23 10:16:22,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4960 Valid, 522 Invalid, 7520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3641 Valid, 3879 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2023-11-23 10:16:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2023-11-23 10:16:22,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4521. [2023-11-23 10:16:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4521 states, 2825 states have (on average 1.3026548672566372) internal successors, (3680), 2964 states have internal predecessors, (3680), 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:16:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4521 states to 4521 states and 6371 transitions. [2023-11-23 10:16:22,520 INFO L78 Accepts]: Start accepts. Automaton has 4521 states and 6371 transitions. Word has length 107 [2023-11-23 10:16:22,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:16:22,520 INFO L495 AbstractCegarLoop]: Abstraction has 4521 states and 6371 transitions. [2023-11-23 10:16:22,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 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:16:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 4521 states and 6371 transitions. [2023-11-23 10:16:22,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-23 10:16:22,522 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:16:22,522 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:16:22,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 10:16:22,522 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:16:22,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:16:22,523 INFO L85 PathProgramCache]: Analyzing trace with hash 248118742, now seen corresponding path program 1 times [2023-11-23 10:16:22,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:16:22,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621961844] [2023-11-23 10:16:22,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:16:22,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:16:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:16:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:16:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:16:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:16:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:16:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:16:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:16:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:16:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:16:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:16:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:16:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:16:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:16:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:16:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:16:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:16:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:16:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 10:16:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 10:16:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:22,874 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:16:22,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:16:22,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621961844] [2023-11-23 10:16:22,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621961844] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:16:22,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:16:22,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:16:22,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958227733] [2023-11-23 10:16:22,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:16:22,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:16:22,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:16:22,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:16:22,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:16:22,876 INFO L87 Difference]: Start difference. First operand 4521 states and 6371 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:16:23,894 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:16:30,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:16:30,715 INFO L93 Difference]: Finished difference Result 4521 states and 6371 transitions. [2023-11-23 10:16:30,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:16:30,715 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:16:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:16:30,723 INFO L225 Difference]: With dead ends: 4521 [2023-11-23 10:16:30,723 INFO L226 Difference]: Without dead ends: 4519 [2023-11-23 10:16:30,724 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:16:30,724 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4167 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 4831 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s 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.4s IncrementalHoareTripleChecker+Time [2023-11-23 10:16:30,725 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.4s Time] [2023-11-23 10:16:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2023-11-23 10:16:31,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4519. [2023-11-23 10:16:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4519 states, 2824 states have (on average 1.3024079320113315) 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:16:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4519 states to 4519 states and 6369 transitions. [2023-11-23 10:16:31,064 INFO L78 Accepts]: Start accepts. Automaton has 4519 states and 6369 transitions. Word has length 98 [2023-11-23 10:16:31,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:16:31,065 INFO L495 AbstractCegarLoop]: Abstraction has 4519 states and 6369 transitions. [2023-11-23 10:16:31,065 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:16:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 4519 states and 6369 transitions. [2023-11-23 10:16:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-23 10:16:31,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:16:31,067 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:16:31,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 10:16:31,067 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:16:31,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:16:31,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1559554751, now seen corresponding path program 1 times [2023-11-23 10:16:31,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:16:31,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843856621] [2023-11-23 10:16:31,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:16:31,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:16:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:16:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:16:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:16:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:16:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:16:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:16:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:16:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:16:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:16:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:16:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:16:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:16:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:16:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:16:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:16:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:16:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:16:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 10:16:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 10:16:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 10:16:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:31,423 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:16:31,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:16:31,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843856621] [2023-11-23 10:16:31,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843856621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:16:31,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:16:31,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:16:31,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293636228] [2023-11-23 10:16:31,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:16:31,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:16:31,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:16:31,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:16:31,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:16:31,426 INFO L87 Difference]: Start difference. First operand 4519 states and 6369 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:16:32,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:16:38,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:16:38,585 INFO L93 Difference]: Finished difference Result 4519 states and 6369 transitions. [2023-11-23 10:16:38,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:16:38,586 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:16:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:16:38,596 INFO L225 Difference]: With dead ends: 4519 [2023-11-23 10:16:38,596 INFO L226 Difference]: Without dead ends: 4517 [2023-11-23 10:16:38,598 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:16:38,599 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4161 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 4827 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s 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, 6.7s IncrementalHoareTripleChecker+Time [2023-11-23 10:16:38,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4241 Valid, 627 Invalid, 7637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4827 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-11-23 10:16:38,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2023-11-23 10:16:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 4517. [2023-11-23 10:16:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4517 states, 2823 states have (on average 1.302160821820758) 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:16:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 6367 transitions. [2023-11-23 10:16:38,965 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 6367 transitions. Word has length 103 [2023-11-23 10:16:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:16:38,966 INFO L495 AbstractCegarLoop]: Abstraction has 4517 states and 6367 transitions. [2023-11-23 10:16:38,966 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:16:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 6367 transitions. [2023-11-23 10:16:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-23 10:16:38,967 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:16:38,967 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:16:38,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 10:16:38,968 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:16:38,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:16:38,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1910076277, now seen corresponding path program 1 times [2023-11-23 10:16:38,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:16:38,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74936683] [2023-11-23 10:16:38,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:16:38,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:16:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:16:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:16:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:16:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:16:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:16:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:16:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:16:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:16:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:16:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:16:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:16:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:16:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:16:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:16:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:16:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:16:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:16:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 10:16:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 10:16:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 10:16:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:16:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:39,340 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:16:39,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:16:39,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74936683] [2023-11-23 10:16:39,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74936683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:16:39,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:16:39,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:16:39,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29653611] [2023-11-23 10:16:39,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:16:39,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:16:39,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:16:39,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:16:39,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:16:39,343 INFO L87 Difference]: Start difference. First operand 4517 states and 6367 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:16:40,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:16:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:16:47,555 INFO L93 Difference]: Finished difference Result 4517 states and 6367 transitions. [2023-11-23 10:16:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:16:47,555 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:16:47,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:16:47,563 INFO L225 Difference]: With dead ends: 4517 [2023-11-23 10:16:47,564 INFO L226 Difference]: Without dead ends: 4515 [2023-11-23 10:16:47,565 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:16:47,566 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:16:47,566 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:16:47,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2023-11-23 10:16:47,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 4515. [2023-11-23 10:16:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4515 states, 2822 states have (on average 1.301913536498937) 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:16:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 6365 transitions. [2023-11-23 10:16:47,899 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 6365 transitions. Word has length 108 [2023-11-23 10:16:47,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:16:47,900 INFO L495 AbstractCegarLoop]: Abstraction has 4515 states and 6365 transitions. [2023-11-23 10:16:47,900 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:16:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 6365 transitions. [2023-11-23 10:16:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 10:16:47,901 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:16:47,901 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:16:47,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-23 10:16:47,902 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:16:47,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:16:47,902 INFO L85 PathProgramCache]: Analyzing trace with hash -947224458, now seen corresponding path program 1 times [2023-11-23 10:16:47,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:16:47,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563406737] [2023-11-23 10:16:47,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:16:47,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:16:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:16:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:16:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:16:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:16:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:16:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:16:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:16:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:16:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:16:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:16:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:16:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:16:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:16:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:16:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:16:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:16:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:16:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 10:16:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 10:16:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 10:16:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:16:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-23 10:16:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:48,328 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:16:48,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:16:48,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563406737] [2023-11-23 10:16:48,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563406737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:16:48,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:16:48,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:16:48,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957513052] [2023-11-23 10:16:48,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:16:48,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:16:48,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:16:48,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:16:48,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:16:48,332 INFO L87 Difference]: Start difference. First operand 4515 states and 6365 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:16:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:16:55,606 INFO L93 Difference]: Finished difference Result 4515 states and 6365 transitions. [2023-11-23 10:16:55,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:16:55,607 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:16:55,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:16:55,617 INFO L225 Difference]: With dead ends: 4515 [2023-11-23 10:16:55,617 INFO L226 Difference]: Without dead ends: 4513 [2023-11-23 10:16:55,619 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:16:55,620 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4149 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 4819 mSolverCounterSat, 2810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s 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, 6.8s IncrementalHoareTripleChecker+Time [2023-11-23 10:16:55,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4227 Valid, 627 Invalid, 7629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2810 Valid, 4819 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2023-11-23 10:16:55,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4513 states. [2023-11-23 10:16:55,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4513 to 4513. [2023-11-23 10:16:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4513 states, 2821 states have (on average 1.3016660758596243) 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:16:56,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4513 states to 4513 states and 6363 transitions. [2023-11-23 10:16:56,014 INFO L78 Accepts]: Start accepts. Automaton has 4513 states and 6363 transitions. Word has length 113 [2023-11-23 10:16:56,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:16:56,014 INFO L495 AbstractCegarLoop]: Abstraction has 4513 states and 6363 transitions. [2023-11-23 10:16:56,015 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:16:56,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4513 states and 6363 transitions. [2023-11-23 10:16:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-23 10:16:56,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:16:56,016 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:16:56,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-23 10:16:56,017 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2023-11-23 10:16:56,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:16:56,017 INFO L85 PathProgramCache]: Analyzing trace with hash 919700055, now seen corresponding path program 1 times [2023-11-23 10:16:56,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:16:56,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703029874] [2023-11-23 10:16:56,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:16:56,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:16:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:16:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 10:16:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 10:16:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 10:16:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 10:16:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 10:16:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 10:16:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:16:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:16:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 10:16:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 10:16:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:16:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:16:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:16:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:16:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 10:16:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 10:16:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 10:16:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 10:16:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 10:16:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:16:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-23 10:16:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-23 10:16:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:16:56,454 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:16:56,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:16:56,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703029874] [2023-11-23 10:16:56,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703029874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:16:56,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:16:56,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:16:56,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079834870] [2023-11-23 10:16:56,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:16:56,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:16:56,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:16:56,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:16:56,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:16:56,458 INFO L87 Difference]: Start difference. First operand 4513 states and 6363 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) Killed by 15