./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.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 a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 14:36:18,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 14:36:18,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 14:36:18,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 14:36:18,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 14:36:18,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 14:36:18,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 14:36:18,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 14:36:18,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 14:36:18,193 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 14:36:18,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 14:36:18,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 14:36:18,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 14:36:18,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 14:36:18,197 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 14:36:18,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 14:36:18,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 14:36:18,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 14:36:18,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 14:36:18,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 14:36:18,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 14:36:18,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 14:36:18,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 14:36:18,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 14:36:18,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 14:36:18,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 14:36:18,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 14:36:18,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 14:36:18,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 14:36:18,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 14:36:18,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 14:36:18,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 14:36:18,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 14:36:18,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 14:36:18,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 14:36:18,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 14:36:18,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 14:36:18,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 14:36:18,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 14:36:18,204 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 -> a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 [2024-10-24 14:36:18,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 14:36:18,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 14:36:18,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 14:36:18,481 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 14:36:18,482 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 14:36:18,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2024-10-24 14:36:19,975 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 14:36:20,335 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 14:36:20,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2024-10-24 14:36:20,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/081a6768f/55da71828ba54fc4aa646a62ca7baecf/FLAG8bdf7eec2 [2024-10-24 14:36:20,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/081a6768f/55da71828ba54fc4aa646a62ca7baecf [2024-10-24 14:36:20,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 14:36:20,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 14:36:20,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 14:36:20,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 14:36:20,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 14:36:20,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:36:20" (1/1) ... [2024-10-24 14:36:20,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5846146e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:20, skipping insertion in model container [2024-10-24 14:36:20,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:36:20" (1/1) ... [2024-10-24 14:36:20,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 14:36:23,342 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[309910,309923] [2024-10-24 14:36:23,347 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310055,310068] [2024-10-24 14:36:23,348 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310201,310214] [2024-10-24 14:36:23,348 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310366,310379] [2024-10-24 14:36:23,349 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2024-10-24 14:36:23,349 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2024-10-24 14:36:23,350 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2024-10-24 14:36:23,350 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2024-10-24 14:36:23,350 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2024-10-24 14:36:23,351 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2024-10-24 14:36:23,351 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2024-10-24 14:36:23,352 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2024-10-24 14:36:23,352 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2024-10-24 14:36:23,353 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2024-10-24 14:36:23,357 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2024-10-24 14:36:23,358 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2024-10-24 14:36:23,358 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2024-10-24 14:36:23,358 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2024-10-24 14:36:23,358 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2024-10-24 14:36:23,359 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2024-10-24 14:36:23,359 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2024-10-24 14:36:23,359 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2024-10-24 14:36:23,360 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2024-10-24 14:36:23,360 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2024-10-24 14:36:23,360 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2024-10-24 14:36:23,361 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2024-10-24 14:36:23,362 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2024-10-24 14:36:23,362 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2024-10-24 14:36:23,362 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2024-10-24 14:36:23,363 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2024-10-24 14:36:23,363 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2024-10-24 14:36:23,364 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2024-10-24 14:36:23,364 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2024-10-24 14:36:23,364 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2024-10-24 14:36:23,365 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315072,315085] [2024-10-24 14:36:23,366 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315228,315241] [2024-10-24 14:36:23,366 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315392,315405] [2024-10-24 14:36:23,366 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2024-10-24 14:36:23,367 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2024-10-24 14:36:23,367 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2024-10-24 14:36:23,368 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2024-10-24 14:36:23,368 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2024-10-24 14:36:23,370 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2024-10-24 14:36:23,370 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2024-10-24 14:36:23,370 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2024-10-24 14:36:23,371 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2024-10-24 14:36:23,371 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2024-10-24 14:36:23,372 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2024-10-24 14:36:23,372 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2024-10-24 14:36:23,373 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2024-10-24 14:36:23,373 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2024-10-24 14:36:23,373 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2024-10-24 14:36:23,374 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2024-10-24 14:36:23,375 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2024-10-24 14:36:23,375 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2024-10-24 14:36:23,375 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2024-10-24 14:36:23,376 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2024-10-24 14:36:23,376 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2024-10-24 14:36:23,377 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2024-10-24 14:36:23,377 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2024-10-24 14:36:23,377 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2024-10-24 14:36:23,378 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2024-10-24 14:36:23,378 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2024-10-24 14:36:23,379 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2024-10-24 14:36:23,379 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2024-10-24 14:36:23,380 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2024-10-24 14:36:23,380 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2024-10-24 14:36:23,381 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2024-10-24 14:36:23,381 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320338,320351] [2024-10-24 14:36:23,381 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320487,320500] [2024-10-24 14:36:23,382 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320639,320652] [2024-10-24 14:36:23,382 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320787,320800] [2024-10-24 14:36:23,383 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320940,320953] [2024-10-24 14:36:23,383 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321091,321104] [2024-10-24 14:36:23,383 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321241,321254] [2024-10-24 14:36:23,384 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321388,321401] [2024-10-24 14:36:23,384 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321539,321552] [2024-10-24 14:36:23,384 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321690,321703] [2024-10-24 14:36:23,385 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321838,321851] [2024-10-24 14:36:23,385 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322004,322017] [2024-10-24 14:36:23,385 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322173,322186] [2024-10-24 14:36:23,385 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2024-10-24 14:36:23,386 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2024-10-24 14:36:23,387 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2024-10-24 14:36:23,387 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322805,322818] [2024-10-24 14:36:23,387 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322966,322979] [2024-10-24 14:36:23,388 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323136,323149] [2024-10-24 14:36:23,388 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323298,323311] [2024-10-24 14:36:23,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 14:36:23,428 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 14:36:23,500 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)); [4183-4184] [2024-10-24 14:36:23,501 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"); [4189-4191] [2024-10-24 14:36:23,656 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[309910,309923] [2024-10-24 14:36:23,656 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310055,310068] [2024-10-24 14:36:23,657 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310201,310214] [2024-10-24 14:36:23,657 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310366,310379] [2024-10-24 14:36:23,659 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2024-10-24 14:36:23,661 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2024-10-24 14:36:23,661 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2024-10-24 14:36:23,661 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2024-10-24 14:36:23,661 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2024-10-24 14:36:23,662 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2024-10-24 14:36:23,662 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2024-10-24 14:36:23,662 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2024-10-24 14:36:23,662 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2024-10-24 14:36:23,662 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2024-10-24 14:36:23,663 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2024-10-24 14:36:23,663 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2024-10-24 14:36:23,663 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2024-10-24 14:36:23,663 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2024-10-24 14:36:23,663 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2024-10-24 14:36:23,664 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2024-10-24 14:36:23,664 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2024-10-24 14:36:23,665 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2024-10-24 14:36:23,665 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2024-10-24 14:36:23,665 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2024-10-24 14:36:23,666 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2024-10-24 14:36:23,666 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2024-10-24 14:36:23,669 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2024-10-24 14:36:23,669 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2024-10-24 14:36:23,670 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2024-10-24 14:36:23,670 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2024-10-24 14:36:23,670 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2024-10-24 14:36:23,671 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2024-10-24 14:36:23,671 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2024-10-24 14:36:23,672 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2024-10-24 14:36:23,672 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315072,315085] [2024-10-24 14:36:23,672 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315228,315241] [2024-10-24 14:36:23,673 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315392,315405] [2024-10-24 14:36:23,673 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2024-10-24 14:36:23,673 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2024-10-24 14:36:23,674 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2024-10-24 14:36:23,674 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2024-10-24 14:36:23,675 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2024-10-24 14:36:23,675 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2024-10-24 14:36:23,675 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2024-10-24 14:36:23,676 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2024-10-24 14:36:23,676 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2024-10-24 14:36:23,676 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2024-10-24 14:36:23,677 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2024-10-24 14:36:23,677 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2024-10-24 14:36:23,677 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2024-10-24 14:36:23,677 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2024-10-24 14:36:23,678 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2024-10-24 14:36:23,678 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2024-10-24 14:36:23,679 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2024-10-24 14:36:23,679 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2024-10-24 14:36:23,679 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2024-10-24 14:36:23,679 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2024-10-24 14:36:23,680 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2024-10-24 14:36:23,680 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2024-10-24 14:36:23,681 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2024-10-24 14:36:23,681 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2024-10-24 14:36:23,681 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2024-10-24 14:36:23,681 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2024-10-24 14:36:23,682 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2024-10-24 14:36:23,682 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2024-10-24 14:36:23,683 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2024-10-24 14:36:23,683 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2024-10-24 14:36:23,683 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2024-10-24 14:36:23,683 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320338,320351] [2024-10-24 14:36:23,684 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320487,320500] [2024-10-24 14:36:23,685 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320639,320652] [2024-10-24 14:36:23,686 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320787,320800] [2024-10-24 14:36:23,686 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320940,320953] [2024-10-24 14:36:23,686 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321091,321104] [2024-10-24 14:36:23,686 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321241,321254] [2024-10-24 14:36:23,686 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321388,321401] [2024-10-24 14:36:23,687 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321539,321552] [2024-10-24 14:36:23,687 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321690,321703] [2024-10-24 14:36:23,687 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321838,321851] [2024-10-24 14:36:23,688 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322004,322017] [2024-10-24 14:36:23,688 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322173,322186] [2024-10-24 14:36:23,688 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2024-10-24 14:36:23,689 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2024-10-24 14:36:23,689 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2024-10-24 14:36:23,689 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322805,322818] [2024-10-24 14:36:23,689 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322966,322979] [2024-10-24 14:36:23,690 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323136,323149] [2024-10-24 14:36:23,690 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323298,323311] [2024-10-24 14:36:23,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 14:36:23,867 INFO L204 MainTranslator]: Completed translation [2024-10-24 14:36:23,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:23 WrapperNode [2024-10-24 14:36:23,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 14:36:23,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 14:36:23,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 14:36:23,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 14:36:23,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:23" (1/1) ... [2024-10-24 14:36:23,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:23" (1/1) ... [2024-10-24 14:36:24,073 INFO L138 Inliner]: procedures = 571, calls = 1763, calls flagged for inlining = 244, calls inlined = 125, statements flattened = 2668 [2024-10-24 14:36:24,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 14:36:24,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 14:36:24,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 14:36:24,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 14:36:24,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:23" (1/1) ... [2024-10-24 14:36:24,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:23" (1/1) ... [2024-10-24 14:36:24,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:23" (1/1) ... [2024-10-24 14:36:24,495 INFO L175 MemorySlicer]: Split 358 memory accesses to 20 slices as follows [2, 8, 8, 8, 8, 255, 9, 8, 8, 8, 8, 1, 8, 6, 2, 2, 1, 5, 2, 1]. 71 percent of accesses are in the largest equivalence class. The 146 initializations are split as follows [2, 8, 8, 8, 8, 53, 8, 8, 8, 8, 8, 0, 8, 4, 0, 0, 1, 5, 0, 1]. The 66 writes are split as follows [0, 0, 0, 0, 0, 64, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0]. [2024-10-24 14:36:24,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:23" (1/1) ... [2024-10-24 14:36:24,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:23" (1/1) ... [2024-10-24 14:36:24,557 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:23" (1/1) ... [2024-10-24 14:36:24,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:23" (1/1) ... [2024-10-24 14:36:24,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:23" (1/1) ... [2024-10-24 14:36:24,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:23" (1/1) ... [2024-10-24 14:36:24,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 14:36:24,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 14:36:24,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 14:36:24,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 14:36:24,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:23" (1/1) ... [2024-10-24 14:36:24,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 14:36:24,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:36:24,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 14:36:24,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 14:36:24,775 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2024-10-24 14:36:24,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2024-10-24 14:36:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2024-10-24 14:36:24,776 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2024-10-24 14:36:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-24 14:36:24,776 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-24 14:36:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-24 14:36:24,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-24 14:36:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_remap [2024-10-24 14:36:24,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_remap [2024-10-24 14:36:24,777 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2024-10-24 14:36:24,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2024-10-24 14:36:24,777 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2024-10-24 14:36:24,777 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2024-10-24 14:36:24,777 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2024-10-24 14:36:24,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2024-10-24 14:36:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2024-10-24 14:36:24,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2024-10-24 14:36:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32 [2024-10-24 14:36:24,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32 [2024-10-24 14:36:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2024-10-24 14:36:24,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2024-10-24 14:36:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32 [2024-10-24 14:36:24,779 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32 [2024-10-24 14:36:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-10-24 14:36:24,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-10-24 14:36:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2024-10-24 14:36:24,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2024-10-24 14:36:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 14:36:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2024-10-24 14:36:24,780 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2024-10-24 14:36:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-10-24 14:36:24,781 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-10-24 14:36:24,781 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2024-10-24 14:36:24,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2024-10-24 14:36:24,781 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2024-10-24 14:36:24,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2024-10-24 14:36:24,781 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2024-10-24 14:36:24,781 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2024-10-24 14:36:24,781 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2024-10-24 14:36:24,782 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2024-10-24 14:36:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-24 14:36:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-24 14:36:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-24 14:36:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-24 14:36:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-24 14:36:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-24 14:36:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-24 14:36:24,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-24 14:36:24,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-10-24 14:36:24,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-10-24 14:36:24,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-10-24 14:36:24,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2024-10-24 14:36:24,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2024-10-24 14:36:24,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2024-10-24 14:36:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2024-10-24 14:36:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2024-10-24 14:36:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2024-10-24 14:36:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2024-10-24 14:36:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2024-10-24 14:36:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2024-10-24 14:36:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2024-10-24 14:36:24,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2024-10-24 14:36:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2024-10-24 14:36:24,785 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2024-10-24 14:36:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2024-10-24 14:36:24,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2024-10-24 14:36:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2024-10-24 14:36:24,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2024-10-24 14:36:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 14:36:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 14:36:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 14:36:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 14:36:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 14:36:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 14:36:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 14:36:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-24 14:36:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-24 14:36:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-24 14:36:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-24 14:36:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-24 14:36:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-24 14:36:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-24 14:36:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-24 14:36:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-24 14:36:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-10-24 14:36:24,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-10-24 14:36:24,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2024-10-24 14:36:24,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2024-10-24 14:36:24,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2024-10-24 14:36:24,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2024-10-24 14:36:24,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2024-10-24 14:36:24,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2024-10-24 14:36:24,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2024-10-24 14:36:24,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2024-10-24 14:36:24,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2024-10-24 14:36:24,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2024-10-24 14:36:24,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2024-10-24 14:36:24,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2024-10-24 14:36:24,788 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2024-10-24 14:36:24,788 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2024-10-24 14:36:24,788 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2024-10-24 14:36:24,789 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2024-10-24 14:36:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2024-10-24 14:36:24,789 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2024-10-24 14:36:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2024-10-24 14:36:24,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2024-10-24 14:36:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2024-10-24 14:36:24,789 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2024-10-24 14:36:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2024-10-24 14:36:24,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2024-10-24 14:36:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure virt_to_phys [2024-10-24 14:36:24,789 INFO L138 BoogieDeclarations]: Found implementation of procedure virt_to_phys [2024-10-24 14:36:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 14:36:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2024-10-24 14:36:24,789 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2024-10-24 14:36:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 14:36:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2024-10-24 14:36:24,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2024-10-24 14:36:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 14:36:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 14:36:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 14:36:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 14:36:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-24 14:36:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-24 14:36:24,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-24 14:36:24,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-24 14:36:24,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-24 14:36:24,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-24 14:36:24,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-24 14:36:24,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-24 14:36:24,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-24 14:36:24,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-24 14:36:24,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-10-24 14:36:24,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-10-24 14:36:24,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-10-24 14:36:24,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2024-10-24 14:36:24,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2024-10-24 14:36:24,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2024-10-24 14:36:24,794 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-10-24 14:36:24,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-10-24 14:36:24,795 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2024-10-24 14:36:24,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2024-10-24 14:36:24,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2024-10-24 14:36:24,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2024-10-24 14:36:24,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2024-10-24 14:36:24,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2024-10-24 14:36:24,795 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2024-10-24 14:36:24,795 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2024-10-24 14:36:24,795 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2024-10-24 14:36:24,795 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2024-10-24 14:36:24,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 14:36:24,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 14:36:24,796 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-24 14:36:24,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-24 14:36:24,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 14:36:24,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 14:36:24,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-24 14:36:24,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2024-10-24 14:36:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2024-10-24 14:36:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2024-10-24 14:36:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2024-10-24 14:36:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2024-10-24 14:36:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2024-10-24 14:36:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2024-10-24 14:36:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2024-10-24 14:36:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2024-10-24 14:36:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2024-10-24 14:36:24,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2024-10-24 14:36:24,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2024-10-24 14:36:24,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2024-10-24 14:36:24,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2024-10-24 14:36:24,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2024-10-24 14:36:24,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2024-10-24 14:36:24,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2024-10-24 14:36:24,798 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 14:36:24,798 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 14:36:24,798 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-24 14:36:24,798 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2024-10-24 14:36:24,799 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2024-10-24 14:36:24,799 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2024-10-24 14:36:24,799 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2024-10-24 14:36:24,799 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2024-10-24 14:36:24,799 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2024-10-24 14:36:24,799 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2024-10-24 14:36:24,799 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2024-10-24 14:36:24,799 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2024-10-24 14:36:24,799 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2024-10-24 14:36:24,799 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2024-10-24 14:36:24,799 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2024-10-24 14:36:24,799 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2024-10-24 14:36:24,799 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2024-10-24 14:36:24,799 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2024-10-24 14:36:24,799 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2024-10-24 14:36:24,799 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2024-10-24 14:36:24,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2024-10-24 14:36:24,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2024-10-24 14:36:24,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2024-10-24 14:36:24,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2024-10-24 14:36:24,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2024-10-24 14:36:24,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2024-10-24 14:36:24,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 14:36:24,800 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2024-10-24 14:36:24,800 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2024-10-24 14:36:24,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2024-10-24 14:36:24,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2024-10-24 14:36:24,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 14:36:24,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 14:36:24,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 14:36:24,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 14:36:24,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-24 14:36:24,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-24 14:36:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-24 14:36:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-24 14:36:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-24 14:36:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-24 14:36:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-24 14:36:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-24 14:36:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-24 14:36:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-24 14:36:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-10-24 14:36:24,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-10-24 14:36:24,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-10-24 14:36:24,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2024-10-24 14:36:24,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2024-10-24 14:36:24,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2024-10-24 14:36:24,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 14:36:24,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 14:36:24,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 14:36:24,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-24 14:36:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-24 14:36:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-24 14:36:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-24 14:36:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-24 14:36:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-24 14:36:24,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-24 14:36:24,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-24 14:36:24,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-24 14:36:24,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-24 14:36:24,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-24 14:36:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-10-24 14:36:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-10-24 14:36:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-10-24 14:36:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2024-10-24 14:36:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2024-10-24 14:36:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2024-10-24 14:36:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_slot_get [2024-10-24 14:36:24,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_slot_get [2024-10-24 14:36:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2024-10-24 14:36:24,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2024-10-24 14:36:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-24 14:36:24,808 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-24 14:36:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2024-10-24 14:36:24,808 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2024-10-24 14:36:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2024-10-24 14:36:24,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2024-10-24 14:36:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2024-10-24 14:36:24,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2024-10-24 14:36:24,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2024-10-24 14:36:24,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2024-10-24 14:36:24,809 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_irq_exit [2024-10-24 14:36:24,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_irq_exit [2024-10-24 14:36:24,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-24 14:36:24,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-24 14:36:24,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2024-10-24 14:36:24,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2024-10-24 14:36:24,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2024-10-24 14:36:24,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2024-10-24 14:36:24,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2024-10-24 14:36:24,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2024-10-24 14:36:24,810 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_crcsr_exit [2024-10-24 14:36:24,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_crcsr_exit [2024-10-24 14:36:24,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2024-10-24 14:36:24,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2024-10-24 14:36:24,810 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-24 14:36:24,812 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-24 14:36:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2024-10-24 14:36:24,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2024-10-24 14:36:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 14:36:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 14:36:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_remove [2024-10-24 14:36:24,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_remove [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2024-10-24 14:36:24,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-24 14:36:24,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-24 14:36:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2024-10-24 14:36:24,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2024-10-24 14:36:24,814 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2024-10-24 14:36:24,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2024-10-24 14:36:24,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_dma_busy [2024-10-24 14:36:24,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_dma_busy [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-24 14:36:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-24 14:36:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-24 14:36:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-24 14:36:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-24 14:36:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-24 14:36:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-24 14:36:25,239 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 14:36:25,242 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 14:36:25,270 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-24 14:36:26,952 INFO L? ?]: Removed 1241 outVars from TransFormulas that were not future-live. [2024-10-24 14:36:26,952 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 14:36:27,149 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 14:36:27,149 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 14:36:27,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:36:27 BoogieIcfgContainer [2024-10-24 14:36:27,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 14:36:27,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 14:36:27,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 14:36:27,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 14:36:27,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:36:20" (1/3) ... [2024-10-24 14:36:27,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50085281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:36:27, skipping insertion in model container [2024-10-24 14:36:27,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:23" (2/3) ... [2024-10-24 14:36:27,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50085281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:36:27, skipping insertion in model container [2024-10-24 14:36:27,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:36:27" (3/3) ... [2024-10-24 14:36:27,156 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2024-10-24 14:36:27,178 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 14:36:27,178 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-10-24 14:36:27,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 14:36:27,312 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@76d40e18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 14:36:27,312 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-10-24 14:36:27,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 955 states, 580 states have (on average 1.3379310344827586) internal successors, (776), 621 states have internal predecessors, (776), 272 states have call successors, (272), 75 states have call predecessors, (272), 74 states have return successors, (269), 269 states have call predecessors, (269), 269 states have call successors, (269) [2024-10-24 14:36:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 14:36:27,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:27,346 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:36:27,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:36:27,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:27,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1957241157, now seen corresponding path program 1 times [2024-10-24 14:36:27,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:27,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307974691] [2024-10-24 14:36:27,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:27,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:36:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:36:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:36:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:36:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:36:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:36:28,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:28,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307974691] [2024-10-24 14:36:28,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307974691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:28,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:28,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:28,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462458702] [2024-10-24 14:36:28,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:28,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:28,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:28,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:28,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:28,162 INFO L87 Difference]: Start difference. First operand has 955 states, 580 states have (on average 1.3379310344827586) internal successors, (776), 621 states have internal predecessors, (776), 272 states have call successors, (272), 75 states have call predecessors, (272), 74 states have return successors, (269), 269 states have call predecessors, (269), 269 states have call successors, (269) Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 14:36:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:31,605 INFO L93 Difference]: Finished difference Result 2806 states and 4008 transitions. [2024-10-24 14:36:31,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 14:36:31,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 47 [2024-10-24 14:36:31,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:31,636 INFO L225 Difference]: With dead ends: 2806 [2024-10-24 14:36:31,636 INFO L226 Difference]: Without dead ends: 1854 [2024-10-24 14:36:31,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-24 14:36:31,647 INFO L432 NwaCegarLoop]: 934 mSDtfsCounter, 2270 mSDsluCounter, 2093 mSDsCounter, 0 mSdLazyCounter, 2865 mSolverCounterSat, 1469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2430 SdHoareTripleChecker+Valid, 3027 SdHoareTripleChecker+Invalid, 4334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1469 IncrementalHoareTripleChecker+Valid, 2865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:31,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2430 Valid, 3027 Invalid, 4334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1469 Valid, 2865 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-24 14:36:31,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2024-10-24 14:36:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1677. [2024-10-24 14:36:31,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1677 states, 1037 states have (on average 1.2902603664416585) internal successors, (1338), 1094 states have internal predecessors, (1338), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:36:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2311 transitions. [2024-10-24 14:36:31,876 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2311 transitions. Word has length 47 [2024-10-24 14:36:31,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:31,877 INFO L471 AbstractCegarLoop]: Abstraction has 1677 states and 2311 transitions. [2024-10-24 14:36:31,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 14:36:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2311 transitions. [2024-10-24 14:36:31,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 14:36:31,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:31,880 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:36:31,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 14:36:31,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:36:31,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:31,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1652659797, now seen corresponding path program 1 times [2024-10-24 14:36:31,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:31,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905541847] [2024-10-24 14:36:31,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:31,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:32,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:32,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:32,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:36:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:32,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:32,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:36:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:32,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:36:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:32,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:32,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:36:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:32,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:36:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:32,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:36:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:36:32,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:32,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905541847] [2024-10-24 14:36:32,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905541847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:32,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:32,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:32,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134802867] [2024-10-24 14:36:32,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:32,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:32,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:32,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:32,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:32,247 INFO L87 Difference]: Start difference. First operand 1677 states and 2311 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 14:36:34,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:34,250 INFO L93 Difference]: Finished difference Result 1677 states and 2311 transitions. [2024-10-24 14:36:34,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:34,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 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 52 [2024-10-24 14:36:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:34,270 INFO L225 Difference]: With dead ends: 1677 [2024-10-24 14:36:34,270 INFO L226 Difference]: Without dead ends: 1675 [2024-10-24 14:36:34,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:34,275 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1591 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:34,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 1874 Invalid, 2695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 14:36:34,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2024-10-24 14:36:34,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1675. [2024-10-24 14:36:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1036 states have (on average 1.2895752895752897) internal successors, (1336), 1092 states have internal predecessors, (1336), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:36:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2309 transitions. [2024-10-24 14:36:34,450 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2309 transitions. Word has length 52 [2024-10-24 14:36:34,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:34,451 INFO L471 AbstractCegarLoop]: Abstraction has 1675 states and 2309 transitions. [2024-10-24 14:36:34,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 14:36:34,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2309 transitions. [2024-10-24 14:36:34,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 14:36:34,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:34,453 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:36:34,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 14:36:34,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:36:34,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:34,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1182610183, now seen corresponding path program 1 times [2024-10-24 14:36:34,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:34,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580569630] [2024-10-24 14:36:34,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:34,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:36:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:36:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:36:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:36:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:36:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:36:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:36:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,758 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:36:34,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:34,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580569630] [2024-10-24 14:36:34,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580569630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:34,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:34,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:34,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901005582] [2024-10-24 14:36:34,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:34,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:34,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:34,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:34,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:34,760 INFO L87 Difference]: Start difference. First operand 1675 states and 2309 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 14:36:36,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:36,485 INFO L93 Difference]: Finished difference Result 1675 states and 2309 transitions. [2024-10-24 14:36:36,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:36,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 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 57 [2024-10-24 14:36:36,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:36,493 INFO L225 Difference]: With dead ends: 1675 [2024-10-24 14:36:36,493 INFO L226 Difference]: Without dead ends: 1673 [2024-10-24 14:36:36,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:36,494 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1585 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:36,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1745 Valid, 1874 Invalid, 2691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 14:36:36,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2024-10-24 14:36:36,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2024-10-24 14:36:36,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1035 states have (on average 1.288888888888889) internal successors, (1334), 1090 states have internal predecessors, (1334), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:36:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2307 transitions. [2024-10-24 14:36:36,570 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2307 transitions. Word has length 57 [2024-10-24 14:36:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:36,572 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2307 transitions. [2024-10-24 14:36:36,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 14:36:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2307 transitions. [2024-10-24 14:36:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-24 14:36:36,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:36,576 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:36:36,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 14:36:36,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:36:36,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:36,577 INFO L85 PathProgramCache]: Analyzing trace with hash -156758833, now seen corresponding path program 1 times [2024-10-24 14:36:36,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:36,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704589100] [2024-10-24 14:36:36,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:36,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:36:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:36:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:36:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:36:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:36:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:36:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:36:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:36:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,854 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:36:36,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:36,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704589100] [2024-10-24 14:36:36,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704589100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:36,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:36,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:36,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168116455] [2024-10-24 14:36:36,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:36,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:36,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:36,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:36,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:36,857 INFO L87 Difference]: Start difference. First operand 1673 states and 2307 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 14:36:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:38,586 INFO L93 Difference]: Finished difference Result 1673 states and 2307 transitions. [2024-10-24 14:36:38,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:38,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 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 62 [2024-10-24 14:36:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:38,592 INFO L225 Difference]: With dead ends: 1673 [2024-10-24 14:36:38,593 INFO L226 Difference]: Without dead ends: 1671 [2024-10-24 14:36:38,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:38,594 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1579 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:38,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 1874 Invalid, 2687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 14:36:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2024-10-24 14:36:38,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1671. [2024-10-24 14:36:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1034 states have (on average 1.2882011605415862) internal successors, (1332), 1088 states have internal predecessors, (1332), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:36:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2305 transitions. [2024-10-24 14:36:38,662 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2305 transitions. Word has length 62 [2024-10-24 14:36:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:38,663 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2305 transitions. [2024-10-24 14:36:38,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 14:36:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2305 transitions. [2024-10-24 14:36:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 14:36:38,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:38,668 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:36:38,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 14:36:38,669 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:36:38,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:38,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1012408261, now seen corresponding path program 1 times [2024-10-24 14:36:38,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:38,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439548543] [2024-10-24 14:36:38,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:38,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:38,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:38,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:38,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:36:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:38,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:38,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:36:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:38,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:36:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:38,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:38,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:36:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:38,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:36:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:38,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:36:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:38,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:36:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:38,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:36:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:38,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 14:36:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:36:38,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:38,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439548543] [2024-10-24 14:36:38,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439548543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:38,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:38,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:38,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360815391] [2024-10-24 14:36:38,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:38,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:38,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:38,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:38,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:38,931 INFO L87 Difference]: Start difference. First operand 1671 states and 2305 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 14:36:40,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:40,680 INFO L93 Difference]: Finished difference Result 1671 states and 2305 transitions. [2024-10-24 14:36:40,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:40,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 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 67 [2024-10-24 14:36:40,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:40,688 INFO L225 Difference]: With dead ends: 1671 [2024-10-24 14:36:40,688 INFO L226 Difference]: Without dead ends: 1669 [2024-10-24 14:36:40,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:40,690 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1573 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:40,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1731 Valid, 1874 Invalid, 2683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 14:36:40,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2024-10-24 14:36:40,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1669. [2024-10-24 14:36:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1033 states have (on average 1.287512100677638) internal successors, (1330), 1086 states have internal predecessors, (1330), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:36:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2303 transitions. [2024-10-24 14:36:40,757 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2303 transitions. Word has length 67 [2024-10-24 14:36:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:40,758 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2303 transitions. [2024-10-24 14:36:40,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 14:36:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2303 transitions. [2024-10-24 14:36:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 14:36:40,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:40,759 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:36:40,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 14:36:40,760 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:36:40,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:40,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2119159064, now seen corresponding path program 1 times [2024-10-24 14:36:40,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:40,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532071549] [2024-10-24 14:36:40,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:40,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:40,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:40,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:40,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:36:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:40,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:40,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:36:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:40,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:36:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:40,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:40,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:36:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:40,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:36:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:40,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:36:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:40,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:36:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:40,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:36:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:40,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 14:36:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:40,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:36:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:36:40,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:40,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532071549] [2024-10-24 14:36:40,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532071549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:40,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:40,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:40,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831601872] [2024-10-24 14:36:40,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:40,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:40,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:40,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:40,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:40,982 INFO L87 Difference]: Start difference. First operand 1669 states and 2303 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 14:36:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:42,802 INFO L93 Difference]: Finished difference Result 1669 states and 2303 transitions. [2024-10-24 14:36:42,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:42,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 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 72 [2024-10-24 14:36:42,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:42,812 INFO L225 Difference]: With dead ends: 1669 [2024-10-24 14:36:42,812 INFO L226 Difference]: Without dead ends: 1667 [2024-10-24 14:36:42,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:42,815 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1567 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:42,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 1874 Invalid, 2679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 14:36:42,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2024-10-24 14:36:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1667. [2024-10-24 14:36:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1032 states have (on average 1.2868217054263567) internal successors, (1328), 1084 states have internal predecessors, (1328), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:36:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2301 transitions. [2024-10-24 14:36:42,957 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2301 transitions. Word has length 72 [2024-10-24 14:36:42,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:42,960 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2301 transitions. [2024-10-24 14:36:42,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 14:36:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2301 transitions. [2024-10-24 14:36:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 14:36:42,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:42,962 INFO L215 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] [2024-10-24 14:36:42,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 14:36:42,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:36:42,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:42,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1919243951, now seen corresponding path program 1 times [2024-10-24 14:36:42,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:42,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138450035] [2024-10-24 14:36:42,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:42,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:36:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 14:36:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 14:36:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 14:36:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:36:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:36:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 14:36:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 14:36:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-24 14:36:43,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:43,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138450035] [2024-10-24 14:36:43,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138450035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:43,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:43,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 14:36:43,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108301550] [2024-10-24 14:36:43,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:43,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 14:36:43,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:43,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 14:36:43,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:36:43,827 INFO L87 Difference]: Start difference. First operand 1667 states and 2301 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 14:36:47,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:47,283 INFO L93 Difference]: Finished difference Result 3408 states and 4733 transitions. [2024-10-24 14:36:47,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 14:36:47,283 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 92 [2024-10-24 14:36:47,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:47,291 INFO L225 Difference]: With dead ends: 3408 [2024-10-24 14:36:47,291 INFO L226 Difference]: Without dead ends: 1759 [2024-10-24 14:36:47,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-10-24 14:36:47,296 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1736 mSDsluCounter, 2553 mSDsCounter, 0 mSdLazyCounter, 3806 mSolverCounterSat, 1375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1895 SdHoareTripleChecker+Valid, 3236 SdHoareTripleChecker+Invalid, 5181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1375 IncrementalHoareTripleChecker+Valid, 3806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:47,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1895 Valid, 3236 Invalid, 5181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1375 Valid, 3806 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-24 14:36:47,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2024-10-24 14:36:47,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1683. [2024-10-24 14:36:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1040 states have (on average 1.2826923076923078) internal successors, (1334), 1092 states have internal predecessors, (1334), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:36:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2307 transitions. [2024-10-24 14:36:47,455 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2307 transitions. Word has length 92 [2024-10-24 14:36:47,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:47,457 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2307 transitions. [2024-10-24 14:36:47,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 14:36:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2307 transitions. [2024-10-24 14:36:47,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 14:36:47,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:47,459 INFO L215 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] [2024-10-24 14:36:47,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 14:36:47,460 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:36:47,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1919303533, now seen corresponding path program 1 times [2024-10-24 14:36:47,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:47,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694495649] [2024-10-24 14:36:47,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:47,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:36:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 14:36:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 14:36:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 14:36:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:36:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:36:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 14:36:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 14:36:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-24 14:36:47,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:47,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694495649] [2024-10-24 14:36:47,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694495649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:47,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:47,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 14:36:47,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869448844] [2024-10-24 14:36:47,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:47,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 14:36:47,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:47,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 14:36:47,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:36:47,784 INFO L87 Difference]: Start difference. First operand 1683 states and 2307 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 14:36:50,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:50,120 INFO L93 Difference]: Finished difference Result 1759 states and 2440 transitions. [2024-10-24 14:36:50,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 14:36:50,121 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-24 14:36:50,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:50,127 INFO L225 Difference]: With dead ends: 1759 [2024-10-24 14:36:50,127 INFO L226 Difference]: Without dead ends: 1757 [2024-10-24 14:36:50,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-24 14:36:50,128 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 992 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 2862 mSolverCounterSat, 1144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 4006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1144 IncrementalHoareTripleChecker+Valid, 2862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:50,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 2720 Invalid, 4006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1144 Valid, 2862 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 14:36:50,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2024-10-24 14:36:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1681. [2024-10-24 14:36:50,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1039 states have (on average 1.2810394610202118) internal successors, (1331), 1090 states have internal predecessors, (1331), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:36:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2304 transitions. [2024-10-24 14:36:50,232 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2304 transitions. Word has length 92 [2024-10-24 14:36:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:50,232 INFO L471 AbstractCegarLoop]: Abstraction has 1681 states and 2304 transitions. [2024-10-24 14:36:50,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 14:36:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2304 transitions. [2024-10-24 14:36:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 14:36:50,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:50,234 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:36:50,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 14:36:50,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:36:50,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:50,235 INFO L85 PathProgramCache]: Analyzing trace with hash 992782444, now seen corresponding path program 1 times [2024-10-24 14:36:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:50,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79976975] [2024-10-24 14:36:50,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:50,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:36:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:36:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:36:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:36:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:36:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:36:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:36:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:36:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 14:36:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:36:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:36:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:36:50,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:50,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79976975] [2024-10-24 14:36:50,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79976975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:50,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:50,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:50,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520657036] [2024-10-24 14:36:50,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:50,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:50,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:50,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:50,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:50,477 INFO L87 Difference]: Start difference. First operand 1681 states and 2304 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 14:36:52,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:52,273 INFO L93 Difference]: Finished difference Result 1681 states and 2304 transitions. [2024-10-24 14:36:52,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:52,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 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 77 [2024-10-24 14:36:52,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:52,287 INFO L225 Difference]: With dead ends: 1681 [2024-10-24 14:36:52,287 INFO L226 Difference]: Without dead ends: 1679 [2024-10-24 14:36:52,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:52,289 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1552 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1745 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:52,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1708 Valid, 1874 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1745 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 14:36:52,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2024-10-24 14:36:52,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679. [2024-10-24 14:36:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1038 states have (on average 1.2803468208092486) internal successors, (1329), 1088 states have internal predecessors, (1329), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:36:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2302 transitions. [2024-10-24 14:36:52,465 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2302 transitions. Word has length 77 [2024-10-24 14:36:52,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:52,466 INFO L471 AbstractCegarLoop]: Abstraction has 1679 states and 2302 transitions. [2024-10-24 14:36:52,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 14:36:52,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2302 transitions. [2024-10-24 14:36:52,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 14:36:52,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:52,467 INFO L215 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] [2024-10-24 14:36:52,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 14:36:52,468 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:36:52,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:52,468 INFO L85 PathProgramCache]: Analyzing trace with hash -854394762, now seen corresponding path program 1 times [2024-10-24 14:36:52,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:52,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712844883] [2024-10-24 14:36:52,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:52,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:36:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 14:36:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 14:36:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 14:36:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:36:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:36:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 14:36:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 14:36:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-24 14:36:52,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:52,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712844883] [2024-10-24 14:36:52,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712844883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:52,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:52,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:52,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368137304] [2024-10-24 14:36:52,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:52,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:52,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:52,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:52,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:52,698 INFO L87 Difference]: Start difference. First operand 1679 states and 2302 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 14:36:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:54,650 INFO L93 Difference]: Finished difference Result 3410 states and 4720 transitions. [2024-10-24 14:36:54,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:54,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 95 [2024-10-24 14:36:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:54,661 INFO L225 Difference]: With dead ends: 3410 [2024-10-24 14:36:54,662 INFO L226 Difference]: Without dead ends: 1749 [2024-10-24 14:36:54,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:54,667 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1862 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 1373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2033 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1373 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:54,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2033 Valid, 1694 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1373 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 14:36:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2024-10-24 14:36:54,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1673. [2024-10-24 14:36:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1033 states have (on average 1.2778315585672797) internal successors, (1320), 1082 states have internal predecessors, (1320), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:36:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2293 transitions. [2024-10-24 14:36:54,823 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2293 transitions. Word has length 95 [2024-10-24 14:36:54,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:54,823 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2293 transitions. [2024-10-24 14:36:54,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 14:36:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2293 transitions. [2024-10-24 14:36:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 14:36:54,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:54,824 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:36:54,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 14:36:54,824 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:36:54,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:54,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1324361744, now seen corresponding path program 1 times [2024-10-24 14:36:54,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:54,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447921442] [2024-10-24 14:36:54,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:54,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:36:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:36:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:36:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:36:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:36:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:36:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:36:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:55,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:36:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:55,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 14:36:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:55,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:36:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:55,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:36:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:55,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:36:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:36:55,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:55,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447921442] [2024-10-24 14:36:55,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447921442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:55,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:55,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:55,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711398742] [2024-10-24 14:36:55,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:55,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:55,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:55,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:55,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:55,031 INFO L87 Difference]: Start difference. First operand 1673 states and 2293 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 14:36:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:56,921 INFO L93 Difference]: Finished difference Result 1673 states and 2293 transitions. [2024-10-24 14:36:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:56,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 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 82 [2024-10-24 14:36:56,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:56,929 INFO L225 Difference]: With dead ends: 1673 [2024-10-24 14:36:56,929 INFO L226 Difference]: Without dead ends: 1671 [2024-10-24 14:36:56,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:56,930 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1531 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1686 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:56,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1686 Valid, 1874 Invalid, 2655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 14:36:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2024-10-24 14:36:57,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1671. [2024-10-24 14:36:57,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1032 states have (on average 1.2771317829457365) internal successors, (1318), 1080 states have internal predecessors, (1318), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:36:57,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2291 transitions. [2024-10-24 14:36:57,074 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2291 transitions. Word has length 82 [2024-10-24 14:36:57,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:57,074 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2291 transitions. [2024-10-24 14:36:57,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 14:36:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2291 transitions. [2024-10-24 14:36:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 14:36:57,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:57,075 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:36:57,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 14:36:57,075 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:36:57,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:57,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1401178253, now seen corresponding path program 1 times [2024-10-24 14:36:57,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:57,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006965243] [2024-10-24 14:36:57,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:57,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:36:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:36:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:36:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:36:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:36:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:36:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:36:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:36:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 14:36:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:36:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:36:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:36:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:36:57,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:57,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006965243] [2024-10-24 14:36:57,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006965243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:57,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:57,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:57,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960971678] [2024-10-24 14:36:57,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:57,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:57,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:57,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:57,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:57,275 INFO L87 Difference]: Start difference. First operand 1671 states and 2291 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, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 14:36:58,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:58,888 INFO L93 Difference]: Finished difference Result 1671 states and 2291 transitions. [2024-10-24 14:36:58,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:58,889 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, (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 84 [2024-10-24 14:36:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:58,897 INFO L225 Difference]: With dead ends: 1671 [2024-10-24 14:36:58,898 INFO L226 Difference]: Without dead ends: 1669 [2024-10-24 14:36:58,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:58,898 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1523 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:58,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1678 Valid, 1874 Invalid, 2651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 14:36:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2024-10-24 14:36:59,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1669. [2024-10-24 14:36:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1031 states have (on average 1.2764306498545102) internal successors, (1316), 1078 states have internal predecessors, (1316), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:36:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2289 transitions. [2024-10-24 14:36:59,079 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2289 transitions. Word has length 84 [2024-10-24 14:36:59,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:59,079 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2289 transitions. [2024-10-24 14:36:59,079 INFO L472 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, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 14:36:59,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2289 transitions. [2024-10-24 14:36:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 14:36:59,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:59,080 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:36:59,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 14:36:59,080 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:36:59,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:59,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1430746745, now seen corresponding path program 1 times [2024-10-24 14:36:59,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:59,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330932535] [2024-10-24 14:36:59,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:59,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:36:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:36:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:36:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:36:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:36:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:36:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:36:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:36:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 14:36:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:36:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:36:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:36:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 14:36:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:36:59,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:59,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330932535] [2024-10-24 14:36:59,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330932535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:59,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:59,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:59,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651868542] [2024-10-24 14:36:59,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:59,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:59,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:59,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:59,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:59,331 INFO L87 Difference]: Start difference. First operand 1669 states and 2289 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 14:37:01,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:01,032 INFO L93 Difference]: Finished difference Result 1669 states and 2289 transitions. [2024-10-24 14:37:01,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:01,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 89 [2024-10-24 14:37:01,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:01,039 INFO L225 Difference]: With dead ends: 1669 [2024-10-24 14:37:01,039 INFO L226 Difference]: Without dead ends: 1667 [2024-10-24 14:37:01,039 INFO L431 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 [2024-10-24 14:37:01,040 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1519 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:01,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 1874 Invalid, 2647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 14:37:01,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2024-10-24 14:37:01,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1667. [2024-10-24 14:37:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1030 states have (on average 1.2757281553398059) internal successors, (1314), 1076 states have internal predecessors, (1314), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:37:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2287 transitions. [2024-10-24 14:37:01,211 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2287 transitions. Word has length 89 [2024-10-24 14:37:01,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:01,212 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2287 transitions. [2024-10-24 14:37:01,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 14:37:01,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2287 transitions. [2024-10-24 14:37:01,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 14:37:01,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:01,213 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:37:01,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 14:37:01,214 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:37:01,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:01,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1664244311, now seen corresponding path program 1 times [2024-10-24 14:37:01,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:01,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855871135] [2024-10-24 14:37:01,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:01,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:37:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:37:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:37:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:37:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:37:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:37:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:37:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:37:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 14:37:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:37:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:37:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:37:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 14:37:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 14:37:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:37:01,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:01,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855871135] [2024-10-24 14:37:01,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855871135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:01,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:01,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:37:01,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987389817] [2024-10-24 14:37:01,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:01,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:37:01,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:01,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:37:01,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:37:01,519 INFO L87 Difference]: Start difference. First operand 1667 states and 2287 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 14:37:03,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:03,409 INFO L93 Difference]: Finished difference Result 1667 states and 2287 transitions. [2024-10-24 14:37:03,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:03,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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 94 [2024-10-24 14:37:03,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:03,417 INFO L225 Difference]: With dead ends: 1667 [2024-10-24 14:37:03,417 INFO L226 Difference]: Without dead ends: 1665 [2024-10-24 14:37:03,417 INFO L431 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 [2024-10-24 14:37:03,418 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1513 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1666 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:03,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1666 Valid, 1874 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 14:37:03,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2024-10-24 14:37:03,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2024-10-24 14:37:03,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1029 states have (on average 1.2750242954324587) internal successors, (1312), 1074 states have internal predecessors, (1312), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:37:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2285 transitions. [2024-10-24 14:37:03,538 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2285 transitions. Word has length 94 [2024-10-24 14:37:03,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:03,539 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2285 transitions. [2024-10-24 14:37:03,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 14:37:03,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2285 transitions. [2024-10-24 14:37:03,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 14:37:03,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:03,540 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:37:03,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 14:37:03,540 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:37:03,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:03,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2008711655, now seen corresponding path program 1 times [2024-10-24 14:37:03,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:03,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190062546] [2024-10-24 14:37:03,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:03,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:37:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:37:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:37:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:37:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:37:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:37:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:37:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:37:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 14:37:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:37:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:37:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:37:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 14:37:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 14:37:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 14:37:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:37:03,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:03,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190062546] [2024-10-24 14:37:03,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190062546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:03,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:03,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:37:03,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688428359] [2024-10-24 14:37:03,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:03,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:37:03,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:03,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:37:03,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:37:03,853 INFO L87 Difference]: Start difference. First operand 1665 states and 2285 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 14:37:05,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:05,593 INFO L93 Difference]: Finished difference Result 1665 states and 2285 transitions. [2024-10-24 14:37:05,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:05,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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 99 [2024-10-24 14:37:05,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:05,603 INFO L225 Difference]: With dead ends: 1665 [2024-10-24 14:37:05,603 INFO L226 Difference]: Without dead ends: 1663 [2024-10-24 14:37:05,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:37:05,604 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1507 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:05,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1659 Valid, 1874 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1715 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 14:37:05,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-10-24 14:37:05,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1663. [2024-10-24 14:37:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1028 states have (on average 1.2743190661478598) internal successors, (1310), 1072 states have internal predecessors, (1310), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:37:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2283 transitions. [2024-10-24 14:37:05,711 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2283 transitions. Word has length 99 [2024-10-24 14:37:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:05,712 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2283 transitions. [2024-10-24 14:37:05,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 14:37:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2283 transitions. [2024-10-24 14:37:05,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 14:37:05,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:05,713 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:37:05,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 14:37:05,713 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:37:05,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:05,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1199055038, now seen corresponding path program 1 times [2024-10-24 14:37:05,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:05,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135283526] [2024-10-24 14:37:05,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:05,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:37:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:37:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:37:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:37:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:37:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:37:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:37:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:37:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 14:37:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:37:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:37:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:37:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 14:37:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 14:37:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 14:37:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 14:37:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:37:05,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:05,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135283526] [2024-10-24 14:37:05,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135283526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:05,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:05,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:37:05,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237735682] [2024-10-24 14:37:05,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:05,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:37:05,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:05,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:37:05,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:37:05,951 INFO L87 Difference]: Start difference. First operand 1663 states and 2283 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 14:37:07,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:07,603 INFO L93 Difference]: Finished difference Result 1663 states and 2283 transitions. [2024-10-24 14:37:07,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:07,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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 104 [2024-10-24 14:37:07,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:07,613 INFO L225 Difference]: With dead ends: 1663 [2024-10-24 14:37:07,613 INFO L226 Difference]: Without dead ends: 1661 [2024-10-24 14:37:07,614 INFO L431 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 [2024-10-24 14:37:07,614 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1501 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:07,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 1874 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 14:37:07,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2024-10-24 14:37:07,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1661. [2024-10-24 14:37:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1027 states have (on average 1.2736124634858812) internal successors, (1308), 1070 states have internal predecessors, (1308), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:37:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2281 transitions. [2024-10-24 14:37:07,728 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2281 transitions. Word has length 104 [2024-10-24 14:37:07,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:07,729 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2281 transitions. [2024-10-24 14:37:07,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 14:37:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2281 transitions. [2024-10-24 14:37:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 14:37:07,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:07,730 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:37:07,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 14:37:07,730 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:37:07,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash 98607650, now seen corresponding path program 1 times [2024-10-24 14:37:07,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:07,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464804812] [2024-10-24 14:37:07,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:07,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:37:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 14:37:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 14:37:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 14:37:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:37:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:37:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 14:37:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 14:37:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 14:37:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:37:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 14:37:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-24 14:37:08,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:08,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464804812] [2024-10-24 14:37:08,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464804812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:08,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:08,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 14:37:08,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634879874] [2024-10-24 14:37:08,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:08,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 14:37:08,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:08,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 14:37:08,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:37:08,137 INFO L87 Difference]: Start difference. First operand 1661 states and 2281 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 14:37:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:10,502 INFO L93 Difference]: Finished difference Result 3378 states and 4666 transitions. [2024-10-24 14:37:10,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:10,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 121 [2024-10-24 14:37:10,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:10,510 INFO L225 Difference]: With dead ends: 3378 [2024-10-24 14:37:10,510 INFO L226 Difference]: Without dead ends: 1735 [2024-10-24 14:37:10,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 14:37:10,516 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 1829 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 1380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2003 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 3297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1380 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:10,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2003 Valid, 1812 Invalid, 3297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1380 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 14:37:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2024-10-24 14:37:10,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1655. [2024-10-24 14:37:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1022 states have (on average 1.2710371819960862) internal successors, (1299), 1064 states have internal predecessors, (1299), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:37:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2272 transitions. [2024-10-24 14:37:10,658 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2272 transitions. Word has length 121 [2024-10-24 14:37:10,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:10,659 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2272 transitions. [2024-10-24 14:37:10,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 14:37:10,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2272 transitions. [2024-10-24 14:37:10,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 14:37:10,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:10,660 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:37:10,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 14:37:10,660 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:37:10,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:10,661 INFO L85 PathProgramCache]: Analyzing trace with hash 37131002, now seen corresponding path program 1 times [2024-10-24 14:37:10,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:10,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657784036] [2024-10-24 14:37:10,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:10,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:37:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:37:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:37:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:37:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:37:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:37:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:37:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:37:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 14:37:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:37:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:37:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:37:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 14:37:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 14:37:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 14:37:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 14:37:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 14:37:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:37:10,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:10,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657784036] [2024-10-24 14:37:10,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657784036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:10,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:10,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:37:10,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544390620] [2024-10-24 14:37:10,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:10,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:37:10,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:10,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:37:10,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:37:10,856 INFO L87 Difference]: Start difference. First operand 1655 states and 2272 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 14:37:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:12,822 INFO L93 Difference]: Finished difference Result 1655 states and 2272 transitions. [2024-10-24 14:37:12,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:12,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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 109 [2024-10-24 14:37:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:12,828 INFO L225 Difference]: With dead ends: 1655 [2024-10-24 14:37:12,828 INFO L226 Difference]: Without dead ends: 1653 [2024-10-24 14:37:12,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:37:12,829 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 1490 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 2630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:12,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 1855 Invalid, 2630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 14:37:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-10-24 14:37:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1653. [2024-10-24 14:37:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1021 states have (on average 1.2703232125367288) internal successors, (1297), 1062 states have internal predecessors, (1297), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:37:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2270 transitions. [2024-10-24 14:37:12,957 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2270 transitions. Word has length 109 [2024-10-24 14:37:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:12,957 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 2270 transitions. [2024-10-24 14:37:12,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 14:37:12,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2270 transitions. [2024-10-24 14:37:12,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 14:37:12,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:12,959 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:37:12,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 14:37:12,959 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:37:12,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:12,959 INFO L85 PathProgramCache]: Analyzing trace with hash -324207322, now seen corresponding path program 1 times [2024-10-24 14:37:12,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:12,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145017041] [2024-10-24 14:37:12,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:12,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:37:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 14:37:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 14:37:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 14:37:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:37:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:37:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 14:37:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 14:37:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 14:37:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:37:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 14:37:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 14:37:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-24 14:37:13,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:13,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145017041] [2024-10-24 14:37:13,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145017041] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:37:13,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107631148] [2024-10-24 14:37:13,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:13,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:37:13,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:37:13,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 14:37:13,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 14:37:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 14:37:13,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:37:13,897 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-24 14:37:13,898 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 14:37:13,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107631148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:13,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 14:37:13,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-24 14:37:13,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439076897] [2024-10-24 14:37:13,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:13,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 14:37:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:13,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 14:37:13,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 14:37:13,899 INFO L87 Difference]: Start difference. First operand 1653 states and 2270 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 14:37:14,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:14,196 INFO L93 Difference]: Finished difference Result 3282 states and 4505 transitions. [2024-10-24 14:37:14,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 14:37:14,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2024-10-24 14:37:14,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:14,202 INFO L225 Difference]: With dead ends: 3282 [2024-10-24 14:37:14,202 INFO L226 Difference]: Without dead ends: 1647 [2024-10-24 14:37:14,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 14:37:14,206 INFO L432 NwaCegarLoop]: 1105 mSDtfsCounter, 1180 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:14,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1105 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 14:37:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2024-10-24 14:37:14,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2024-10-24 14:37:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1016 states have (on average 1.2677165354330708) internal successors, (1288), 1056 states have internal predecessors, (1288), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:37:14,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2261 transitions. [2024-10-24 14:37:14,334 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2261 transitions. Word has length 126 [2024-10-24 14:37:14,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:14,334 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2261 transitions. [2024-10-24 14:37:14,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 14:37:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2261 transitions. [2024-10-24 14:37:14,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 14:37:14,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:14,335 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:37:14,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 14:37:14,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:37:14,541 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:37:14,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:14,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2093124221, now seen corresponding path program 1 times [2024-10-24 14:37:14,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:14,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006219415] [2024-10-24 14:37:14,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:14,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:37:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:37:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:37:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:37:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:37:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:37:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:37:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:37:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 14:37:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:37:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:37:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:37:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 14:37:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 14:37:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 14:37:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 14:37:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 14:37:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 14:37:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:37:14,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:14,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006219415] [2024-10-24 14:37:14,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006219415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:14,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:14,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:37:14,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487291926] [2024-10-24 14:37:14,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:14,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:37:14,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:14,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:37:14,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:37:14,849 INFO L87 Difference]: Start difference. First operand 1647 states and 2261 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 14:37:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:16,890 INFO L93 Difference]: Finished difference Result 1647 states and 2261 transitions. [2024-10-24 14:37:16,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:16,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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 114 [2024-10-24 14:37:16,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:16,896 INFO L225 Difference]: With dead ends: 1647 [2024-10-24 14:37:16,896 INFO L226 Difference]: Without dead ends: 1645 [2024-10-24 14:37:16,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:37:16,897 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 1479 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 2625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:16,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 1836 Invalid, 2625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 14:37:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2024-10-24 14:37:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1645. [2024-10-24 14:37:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1015 states have (on average 1.2669950738916256) internal successors, (1286), 1054 states have internal predecessors, (1286), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:37:17,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2259 transitions. [2024-10-24 14:37:17,037 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2259 transitions. Word has length 114 [2024-10-24 14:37:17,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:17,037 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 2259 transitions. [2024-10-24 14:37:17,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 14:37:17,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2259 transitions. [2024-10-24 14:37:17,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 14:37:17,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:17,039 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:37:17,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 14:37:17,039 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:37:17,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:17,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1156418917, now seen corresponding path program 1 times [2024-10-24 14:37:17,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:17,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13096987] [2024-10-24 14:37:17,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:17,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:37:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:37:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:37:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:37:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:37:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:37:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:37:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:37:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 14:37:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:37:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:37:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:37:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 14:37:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 14:37:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 14:37:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 14:37:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 14:37:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 14:37:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 14:37:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:37:17,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:17,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13096987] [2024-10-24 14:37:17,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13096987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:17,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:17,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:37:17,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085360143] [2024-10-24 14:37:17,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:17,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:37:17,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:17,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:37:17,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:37:17,294 INFO L87 Difference]: Start difference. First operand 1645 states and 2259 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 14:37:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:19,137 INFO L93 Difference]: Finished difference Result 1645 states and 2259 transitions. [2024-10-24 14:37:19,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:19,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 119 [2024-10-24 14:37:19,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:19,142 INFO L225 Difference]: With dead ends: 1645 [2024-10-24 14:37:19,142 INFO L226 Difference]: Without dead ends: 1643 [2024-10-24 14:37:19,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:37:19,143 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 1473 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1621 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 2621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:19,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1621 Valid, 1836 Invalid, 2621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 14:37:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2024-10-24 14:37:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1643. [2024-10-24 14:37:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1014 states have (on average 1.2662721893491125) internal successors, (1284), 1052 states have internal predecessors, (1284), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:37:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2257 transitions. [2024-10-24 14:37:19,288 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2257 transitions. Word has length 119 [2024-10-24 14:37:19,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:19,289 INFO L471 AbstractCegarLoop]: Abstraction has 1643 states and 2257 transitions. [2024-10-24 14:37:19,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 14:37:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2257 transitions. [2024-10-24 14:37:19,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 14:37:19,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:19,291 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:37:19,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 14:37:19,291 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:37:19,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:19,292 INFO L85 PathProgramCache]: Analyzing trace with hash -770702967, now seen corresponding path program 1 times [2024-10-24 14:37:19,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:19,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110128212] [2024-10-24 14:37:19,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:19,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:37:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:37:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:37:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:37:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:37:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:37:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:37:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:37:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 14:37:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:37:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:37:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:37:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 14:37:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 14:37:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 14:37:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 14:37:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 14:37:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 14:37:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 14:37:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 14:37:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:37:19,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:19,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110128212] [2024-10-24 14:37:19,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110128212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:19,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:19,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:37:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910187212] [2024-10-24 14:37:19,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:19,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:37:19,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:19,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:37:19,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:37:19,491 INFO L87 Difference]: Start difference. First operand 1643 states and 2257 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 14:37:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:21,220 INFO L93 Difference]: Finished difference Result 1643 states and 2257 transitions. [2024-10-24 14:37:21,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:21,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 124 [2024-10-24 14:37:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:21,226 INFO L225 Difference]: With dead ends: 1643 [2024-10-24 14:37:21,226 INFO L226 Difference]: Without dead ends: 1641 [2024-10-24 14:37:21,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:37:21,227 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 1467 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1614 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:21,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1614 Valid, 1836 Invalid, 2617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 14:37:21,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2024-10-24 14:37:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1641. [2024-10-24 14:37:21,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1013 states have (on average 1.265547877591313) internal successors, (1282), 1050 states have internal predecessors, (1282), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:37:21,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2255 transitions. [2024-10-24 14:37:21,439 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2255 transitions. Word has length 124 [2024-10-24 14:37:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:21,439 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2255 transitions. [2024-10-24 14:37:21,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 14:37:21,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2255 transitions. [2024-10-24 14:37:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 14:37:21,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:21,441 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:37:21,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 14:37:21,441 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:37:21,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1600807815, now seen corresponding path program 1 times [2024-10-24 14:37:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:21,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229904918] [2024-10-24 14:37:21,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:21,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:37:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:37:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:37:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:37:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:37:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:37:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:37:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:37:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 14:37:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:37:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:37:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:37:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 14:37:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 14:37:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 14:37:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 14:37:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 14:37:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 14:37:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 14:37:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 14:37:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 14:37:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:37:21,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:21,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229904918] [2024-10-24 14:37:21,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229904918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:21,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:21,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:37:21,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221110723] [2024-10-24 14:37:21,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:21,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:37:21,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:21,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:37:21,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:37:21,715 INFO L87 Difference]: Start difference. First operand 1641 states and 2255 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 14:37:23,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:23,352 INFO L93 Difference]: Finished difference Result 1641 states and 2255 transitions. [2024-10-24 14:37:23,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:23,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 129 [2024-10-24 14:37:23,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:23,358 INFO L225 Difference]: With dead ends: 1641 [2024-10-24 14:37:23,358 INFO L226 Difference]: Without dead ends: 1639 [2024-10-24 14:37:23,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:37:23,362 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 1461 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1607 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 2613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:23,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1607 Valid, 1836 Invalid, 2613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 14:37:23,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2024-10-24 14:37:23,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1639. [2024-10-24 14:37:23,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1012 states have (on average 1.2648221343873518) internal successors, (1280), 1048 states have internal predecessors, (1280), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:37:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2253 transitions. [2024-10-24 14:37:23,540 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2253 transitions. Word has length 129 [2024-10-24 14:37:23,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:23,541 INFO L471 AbstractCegarLoop]: Abstraction has 1639 states and 2253 transitions. [2024-10-24 14:37:23,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 14:37:23,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2253 transitions. [2024-10-24 14:37:23,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 14:37:23,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:23,542 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:37:23,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 14:37:23,543 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:37:23,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:23,543 INFO L85 PathProgramCache]: Analyzing trace with hash 162184221, now seen corresponding path program 1 times [2024-10-24 14:37:23,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:23,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493394797] [2024-10-24 14:37:23,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:37:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:37:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:37:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:37:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:37:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:37:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:37:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:37:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 14:37:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:37:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:37:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:37:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 14:37:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 14:37:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 14:37:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 14:37:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 14:37:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 14:37:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 14:37:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 14:37:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 14:37:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 14:37:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:23,889 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:37:23,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:23,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493394797] [2024-10-24 14:37:23,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493394797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:23,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:23,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:37:23,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947415161] [2024-10-24 14:37:23,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:23,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:37:23,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:23,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:37:23,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:37:23,891 INFO L87 Difference]: Start difference. First operand 1639 states and 2253 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 14:37:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:25,556 INFO L93 Difference]: Finished difference Result 1639 states and 2253 transitions. [2024-10-24 14:37:25,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:25,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 134 [2024-10-24 14:37:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:25,562 INFO L225 Difference]: With dead ends: 1639 [2024-10-24 14:37:25,562 INFO L226 Difference]: Without dead ends: 1637 [2024-10-24 14:37:25,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:37:25,563 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 1455 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1600 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 2609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:25,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1600 Valid, 1836 Invalid, 2609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 14:37:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2024-10-24 14:37:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1637. [2024-10-24 14:37:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1637 states, 1011 states have (on average 1.2640949554896141) internal successors, (1278), 1046 states have internal predecessors, (1278), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:37:25,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2251 transitions. [2024-10-24 14:37:25,758 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2251 transitions. Word has length 134 [2024-10-24 14:37:25,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:25,758 INFO L471 AbstractCegarLoop]: Abstraction has 1637 states and 2251 transitions. [2024-10-24 14:37:25,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 14:37:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2251 transitions. [2024-10-24 14:37:25,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-24 14:37:25,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:25,760 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:37:25,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 14:37:25,760 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:37:25,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:25,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1853052498, now seen corresponding path program 1 times [2024-10-24 14:37:25,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:25,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310066944] [2024-10-24 14:37:25,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:25,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:37:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 14:37:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:37:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 14:37:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 14:37:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 14:37:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:37:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:37:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 14:37:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 14:37:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:37:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:37:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 14:37:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 14:37:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 14:37:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 14:37:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 14:37:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 14:37:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 14:37:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 14:37:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 14:37:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 14:37:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 14:37:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 14:37:25,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:25,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310066944] [2024-10-24 14:37:25,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310066944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:25,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:25,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:37:25,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566254106] [2024-10-24 14:37:25,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:25,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:37:25,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:25,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:37:25,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:37:25,974 INFO L87 Difference]: Start difference. First operand 1637 states and 2251 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-24 14:37:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:27,567 INFO L93 Difference]: Finished difference Result 1637 states and 2251 transitions. [2024-10-24 14:37:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:27,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 139 [2024-10-24 14:37:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:27,573 INFO L225 Difference]: With dead ends: 1637 [2024-10-24 14:37:27,577 INFO L226 Difference]: Without dead ends: 1635 [2024-10-24 14:37:27,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:37:27,578 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 1449 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:27,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1593 Valid, 1836 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 14:37:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2024-10-24 14:37:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1635. [2024-10-24 14:37:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1010 states have (on average 1.2633663366336634) internal successors, (1276), 1044 states have internal predecessors, (1276), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-24 14:37:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2249 transitions. [2024-10-24 14:37:27,814 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2249 transitions. Word has length 139 [2024-10-24 14:37:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:27,814 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2249 transitions. [2024-10-24 14:37:27,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-24 14:37:27,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2249 transitions. [2024-10-24 14:37:27,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-24 14:37:27,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:27,826 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:37:27,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 14:37:27,826 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:37:27,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:27,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1617110468, now seen corresponding path program 1 times [2024-10-24 14:37:27,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:27,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606435862] [2024-10-24 14:37:27,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:27,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:37:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 14:37:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 14:37:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 14:37:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:37:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:37:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 14:37:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 14:37:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 14:37:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:37:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 14:37:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 14:37:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:37:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 14:37:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 14:37:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 14:37:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:28,690 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2024-10-24 14:37:28,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:28,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606435862] [2024-10-24 14:37:28,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606435862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:28,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:28,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 14:37:28,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299749876] [2024-10-24 14:37:28,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:28,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 14:37:28,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:28,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 14:37:28,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 14:37:28,693 INFO L87 Difference]: Start difference. First operand 1635 states and 2249 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (25), 7 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-24 14:37:37,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:37,088 INFO L93 Difference]: Finished difference Result 2764 states and 3793 transitions. [2024-10-24 14:37:37,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-24 14:37:37,089 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (25), 7 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 177 [2024-10-24 14:37:37,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:37,097 INFO L225 Difference]: With dead ends: 2764 [2024-10-24 14:37:37,097 INFO L226 Difference]: Without dead ends: 2762 [2024-10-24 14:37:37,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 14:37:37,098 INFO L432 NwaCegarLoop]: 991 mSDtfsCounter, 4882 mSDsluCounter, 5464 mSDsCounter, 0 mSdLazyCounter, 9564 mSolverCounterSat, 4376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5211 SdHoareTripleChecker+Valid, 6455 SdHoareTripleChecker+Invalid, 13940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4376 IncrementalHoareTripleChecker+Valid, 9564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:37,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5211 Valid, 6455 Invalid, 13940 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4376 Valid, 9564 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-10-24 14:37:37,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2024-10-24 14:37:37,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2373. [2024-10-24 14:37:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2373 states, 1474 states have (on average 1.2693351424694708) internal successors, (1871), 1523 states have internal predecessors, (1871), 705 states have call successors, (705), 194 states have call predecessors, (705), 189 states have return successors, (705), 687 states have call predecessors, (705), 703 states have call successors, (705) [2024-10-24 14:37:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 3281 transitions. [2024-10-24 14:37:37,405 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 3281 transitions. Word has length 177 [2024-10-24 14:37:37,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:37,405 INFO L471 AbstractCegarLoop]: Abstraction has 2373 states and 3281 transitions. [2024-10-24 14:37:37,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (25), 7 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-24 14:37:37,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 3281 transitions. [2024-10-24 14:37:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-24 14:37:37,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:37,407 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:37:37,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 14:37:37,407 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-24 14:37:37,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:37,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1833384957, now seen corresponding path program 1 times [2024-10-24 14:37:37,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:37,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86496783] [2024-10-24 14:37:37,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:37,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 14:37:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 14:37:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 14:37:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 14:37:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 14:37:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 14:37:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 14:37:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 14:37:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:37,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 14:37:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:38,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:38,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:37:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:38,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 14:37:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:38,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:38,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:38,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 14:37:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:38,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:38,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 14:37:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:38,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 14:37:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:38,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:38,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:38,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 14:37:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:38,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 14:37:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-24 14:37:38,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:38,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86496783] [2024-10-24 14:37:38,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86496783] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:37:38,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382283960] [2024-10-24 14:37:38,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:38,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:37:38,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:37:38,109 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 14:37:38,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 14:37:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:38,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 1749 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-24 14:37:38,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:37:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-24 14:37:38,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 14:37:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-10-24 14:37:39,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382283960] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 14:37:39,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 14:37:39,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 26 [2024-10-24 14:37:39,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004490876] [2024-10-24 14:37:39,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 14:37:39,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 14:37:39,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:39,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 14:37:39,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2024-10-24 14:37:39,337 INFO L87 Difference]: Start difference. First operand 2373 states and 3281 transitions. Second operand has 26 states, 20 states have (on average 6.5) internal successors, (130), 17 states have internal predecessors, (130), 6 states have call successors, (62), 7 states have call predecessors, (62), 7 states have return successors, (60), 9 states have call predecessors, (60), 6 states have call successors, (60)