./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/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 ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.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.graphml --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 a88d6e7bf2b158373436b40548cbe71d2b3a1f454b281f07c3b1b175d00e8682 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 15:34:02,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 15:34:02,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 15:34:02,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 15:34:02,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 15:34:02,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 15:34:02,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 15:34:02,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 15:34:02,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 15:34:02,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 15:34:02,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 15:34:02,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 15:34:02,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 15:34:02,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 15:34:02,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 15:34:02,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 15:34:02,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 15:34:02,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 15:34:02,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 15:34:02,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 15:34:02,362 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 15:34:02,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 15:34:02,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 15:34:02,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 15:34:02,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 15:34:02,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 15:34:02,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 15:34:02,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 15:34:02,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 15:34:02,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 15:34:02,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 15:34:02,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 15:34:02,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 15:34:02,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 15:34:02,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 15:34:02,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 15:34:02,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 15:34:02,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 15:34:02,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 15:34:02,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 15:34:02,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 15:34:02,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 15:34:02,380 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 15:34:02,410 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 15:34:02,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 15:34:02,411 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 15:34:02,411 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 15:34:02,412 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 15:34:02,412 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 15:34:02,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 15:34:02,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 15:34:02,413 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 15:34:02,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 15:34:02,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 15:34:02,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 15:34:02,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 15:34:02,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 15:34:02,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 15:34:02,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 15:34:02,415 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 15:34:02,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 15:34:02,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 15:34:02,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 15:34:02,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 15:34:02,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:34:02,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 15:34:02,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 15:34:02,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 15:34:02,417 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 15:34:02,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 15:34:02,417 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 15:34:02,417 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 15:34:02,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 15:34:02,418 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> a88d6e7bf2b158373436b40548cbe71d2b3a1f454b281f07c3b1b175d00e8682 [2022-07-21 15:34:02,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 15:34:02,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 15:34:02,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 15:34:02,735 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 15:34:02,736 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 15:34:02,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i [2022-07-21 15:34:02,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a9b448a5/07014553ca124067b336d5d1bb2ea9d5/FLAGaf727614b [2022-07-21 15:34:03,598 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 15:34:03,599 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i [2022-07-21 15:34:03,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a9b448a5/07014553ca124067b336d5d1bb2ea9d5/FLAGaf727614b [2022-07-21 15:34:03,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a9b448a5/07014553ca124067b336d5d1bb2ea9d5 [2022-07-21 15:34:03,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 15:34:03,783 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 15:34:03,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 15:34:03,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 15:34:03,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 15:34:03,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:34:03" (1/1) ... [2022-07-21 15:34:03,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f631bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:34:03, skipping insertion in model container [2022-07-21 15:34:03,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:34:03" (1/1) ... [2022-07-21 15:34:03,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 15:34:03,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 15:34:06,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[410486,410499] [2022-07-21 15:34:06,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[410631,410644] [2022-07-21 15:34:06,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[410777,410790] [2022-07-21 15:34:06,705 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[410942,410955] [2022-07-21 15:34:06,705 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[411100,411113] [2022-07-21 15:34:06,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[411258,411271] [2022-07-21 15:34:06,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[411416,411429] [2022-07-21 15:34:06,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[411576,411589] [2022-07-21 15:34:06,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[411735,411748] [2022-07-21 15:34:06,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[411874,411887] [2022-07-21 15:34:06,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[412016,412029] [2022-07-21 15:34:06,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[412165,412178] [2022-07-21 15:34:06,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[412304,412317] [2022-07-21 15:34:06,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[412459,412472] [2022-07-21 15:34:06,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[412619,412632] [2022-07-21 15:34:06,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[412770,412783] [2022-07-21 15:34:06,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[412921,412934] [2022-07-21 15:34:06,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[413073,413086] [2022-07-21 15:34:06,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[413222,413235] [2022-07-21 15:34:06,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[413370,413383] [2022-07-21 15:34:06,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[413527,413540] [2022-07-21 15:34:06,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[413676,413689] [2022-07-21 15:34:06,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[413832,413845] [2022-07-21 15:34:06,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[413985,413998] [2022-07-21 15:34:06,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[414131,414144] [2022-07-21 15:34:06,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[414274,414287] [2022-07-21 15:34:06,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[414426,414439] [2022-07-21 15:34:06,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[414572,414585] [2022-07-21 15:34:06,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[414717,414730] [2022-07-21 15:34:06,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[414871,414884] [2022-07-21 15:34:06,724 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[415022,415035] [2022-07-21 15:34:06,724 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[415177,415190] [2022-07-21 15:34:06,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[415329,415342] [2022-07-21 15:34:06,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[415484,415497] [2022-07-21 15:34:06,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[415648,415661] [2022-07-21 15:34:06,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[415804,415817] [2022-07-21 15:34:06,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[415968,415981] [2022-07-21 15:34:06,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[416110,416123] [2022-07-21 15:34:06,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[416268,416281] [2022-07-21 15:34:06,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[416435,416448] [2022-07-21 15:34:06,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[416594,416607] [2022-07-21 15:34:06,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[416753,416766] [2022-07-21 15:34:06,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[416902,416915] [2022-07-21 15:34:06,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[417049,417062] [2022-07-21 15:34:06,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[417188,417201] [2022-07-21 15:34:06,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[417351,417364] [2022-07-21 15:34:06,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[417517,417530] [2022-07-21 15:34:06,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[417681,417694] [2022-07-21 15:34:06,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[417846,417859] [2022-07-21 15:34:06,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[418011,418024] [2022-07-21 15:34:06,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[418177,418190] [2022-07-21 15:34:06,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[418342,418355] [2022-07-21 15:34:06,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[418509,418522] [2022-07-21 15:34:06,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[418669,418682] [2022-07-21 15:34:06,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[418831,418844] [2022-07-21 15:34:06,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[418990,419003] [2022-07-21 15:34:06,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[419136,419149] [2022-07-21 15:34:06,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[419279,419292] [2022-07-21 15:34:06,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[419423,419436] [2022-07-21 15:34:06,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[419566,419579] [2022-07-21 15:34:06,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[419710,419723] [2022-07-21 15:34:06,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[419851,419864] [2022-07-21 15:34:06,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[419989,420002] [2022-07-21 15:34:06,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[420147,420160] [2022-07-21 15:34:06,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[420306,420319] [2022-07-21 15:34:06,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[420462,420475] [2022-07-21 15:34:06,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[420611,420624] [2022-07-21 15:34:06,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[420763,420776] [2022-07-21 15:34:06,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[420914,420927] [2022-07-21 15:34:06,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[421063,421076] [2022-07-21 15:34:06,742 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[421215,421228] [2022-07-21 15:34:06,742 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[421363,421376] [2022-07-21 15:34:06,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[421516,421529] [2022-07-21 15:34:06,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[421667,421680] [2022-07-21 15:34:06,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[421817,421830] [2022-07-21 15:34:06,744 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[421964,421977] [2022-07-21 15:34:06,744 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[422115,422128] [2022-07-21 15:34:06,745 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[422266,422279] [2022-07-21 15:34:06,745 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[422414,422427] [2022-07-21 15:34:06,746 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[422580,422593] [2022-07-21 15:34:06,746 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[422749,422762] [2022-07-21 15:34:06,747 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[422916,422929] [2022-07-21 15:34:06,747 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[423084,423097] [2022-07-21 15:34:06,747 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[423234,423247] [2022-07-21 15:34:06,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[423381,423394] [2022-07-21 15:34:06,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[423542,423555] [2022-07-21 15:34:06,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[423712,423725] [2022-07-21 15:34:06,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[423874,423887] [2022-07-21 15:34:06,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:34:06,805 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 15:34:07,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[410486,410499] [2022-07-21 15:34:07,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[410631,410644] [2022-07-21 15:34:07,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[410777,410790] [2022-07-21 15:34:07,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[410942,410955] [2022-07-21 15:34:07,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[411100,411113] [2022-07-21 15:34:07,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[411258,411271] [2022-07-21 15:34:07,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[411416,411429] [2022-07-21 15:34:07,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[411576,411589] [2022-07-21 15:34:07,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[411735,411748] [2022-07-21 15:34:07,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[411874,411887] [2022-07-21 15:34:07,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[412016,412029] [2022-07-21 15:34:07,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[412165,412178] [2022-07-21 15:34:07,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[412304,412317] [2022-07-21 15:34:07,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[412459,412472] [2022-07-21 15:34:07,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[412619,412632] [2022-07-21 15:34:07,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[412770,412783] [2022-07-21 15:34:07,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[412921,412934] [2022-07-21 15:34:07,125 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[413073,413086] [2022-07-21 15:34:07,125 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[413222,413235] [2022-07-21 15:34:07,125 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[413370,413383] [2022-07-21 15:34:07,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[413527,413540] [2022-07-21 15:34:07,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[413676,413689] [2022-07-21 15:34:07,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[413832,413845] [2022-07-21 15:34:07,127 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[413985,413998] [2022-07-21 15:34:07,127 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[414131,414144] [2022-07-21 15:34:07,127 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[414274,414287] [2022-07-21 15:34:07,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[414426,414439] [2022-07-21 15:34:07,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[414572,414585] [2022-07-21 15:34:07,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[414717,414730] [2022-07-21 15:34:07,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[414871,414884] [2022-07-21 15:34:07,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[415022,415035] [2022-07-21 15:34:07,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[415177,415190] [2022-07-21 15:34:07,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[415329,415342] [2022-07-21 15:34:07,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[415484,415497] [2022-07-21 15:34:07,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[415648,415661] [2022-07-21 15:34:07,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[415804,415817] [2022-07-21 15:34:07,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[415968,415981] [2022-07-21 15:34:07,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[416110,416123] [2022-07-21 15:34:07,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[416268,416281] [2022-07-21 15:34:07,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[416435,416448] [2022-07-21 15:34:07,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[416594,416607] [2022-07-21 15:34:07,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[416753,416766] [2022-07-21 15:34:07,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[416902,416915] [2022-07-21 15:34:07,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[417049,417062] [2022-07-21 15:34:07,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[417188,417201] [2022-07-21 15:34:07,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[417351,417364] [2022-07-21 15:34:07,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[417517,417530] [2022-07-21 15:34:07,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[417681,417694] [2022-07-21 15:34:07,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[417846,417859] [2022-07-21 15:34:07,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[418011,418024] [2022-07-21 15:34:07,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[418177,418190] [2022-07-21 15:34:07,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[418342,418355] [2022-07-21 15:34:07,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[418509,418522] [2022-07-21 15:34:07,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[418669,418682] [2022-07-21 15:34:07,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[418831,418844] [2022-07-21 15:34:07,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[418990,419003] [2022-07-21 15:34:07,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[419136,419149] [2022-07-21 15:34:07,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[419279,419292] [2022-07-21 15:34:07,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[419423,419436] [2022-07-21 15:34:07,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[419566,419579] [2022-07-21 15:34:07,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[419710,419723] [2022-07-21 15:34:07,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[419851,419864] [2022-07-21 15:34:07,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[419989,420002] [2022-07-21 15:34:07,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[420147,420160] [2022-07-21 15:34:07,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[420306,420319] [2022-07-21 15:34:07,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[420462,420475] [2022-07-21 15:34:07,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[420611,420624] [2022-07-21 15:34:07,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[420763,420776] [2022-07-21 15:34:07,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[420914,420927] [2022-07-21 15:34:07,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[421063,421076] [2022-07-21 15:34:07,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[421215,421228] [2022-07-21 15:34:07,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[421363,421376] [2022-07-21 15:34:07,158 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[421516,421529] [2022-07-21 15:34:07,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[421667,421680] [2022-07-21 15:34:07,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[421817,421830] [2022-07-21 15:34:07,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[421964,421977] [2022-07-21 15:34:07,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[422115,422128] [2022-07-21 15:34:07,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[422266,422279] [2022-07-21 15:34:07,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[422414,422427] [2022-07-21 15:34:07,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[422580,422593] [2022-07-21 15:34:07,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[422749,422762] [2022-07-21 15:34:07,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[422916,422929] [2022-07-21 15:34:07,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[423084,423097] [2022-07-21 15:34:07,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[423234,423247] [2022-07-21 15:34:07,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[423381,423394] [2022-07-21 15:34:07,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[423542,423555] [2022-07-21 15:34:07,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[423712,423725] [2022-07-21 15:34:07,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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--net--ethernet--amd--amd8111e.ko.cil.i[423874,423887] [2022-07-21 15:34:07,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:34:07,486 INFO L208 MainTranslator]: Completed translation [2022-07-21 15:34:07,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:34:07 WrapperNode [2022-07-21 15:34:07,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 15:34:07,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 15:34:07,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 15:34:07,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 15:34:07,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:34:07" (1/1) ... [2022-07-21 15:34:07,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:34:07" (1/1) ... [2022-07-21 15:34:07,767 INFO L137 Inliner]: procedures = 672, calls = 2071, calls flagged for inlining = 313, calls inlined = 225, statements flattened = 4926 [2022-07-21 15:34:07,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 15:34:07,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 15:34:07,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 15:34:07,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 15:34:07,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:34:07" (1/1) ... [2022-07-21 15:34:07,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:34:07" (1/1) ... [2022-07-21 15:34:07,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:34:07" (1/1) ... [2022-07-21 15:34:07,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:34:07" (1/1) ... [2022-07-21 15:34:07,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:34:07" (1/1) ... [2022-07-21 15:34:07,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:34:07" (1/1) ... [2022-07-21 15:34:07,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:34:07" (1/1) ... [2022-07-21 15:34:07,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 15:34:08,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 15:34:08,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 15:34:08,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 15:34:08,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:34:07" (1/1) ... [2022-07-21 15:34:08,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:34:08,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:34:08,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 15:34:08,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 15:34:08,059 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:34:08,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:34:08,059 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2022-07-21 15:34:08,059 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2022-07-21 15:34:08,059 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_get_stats [2022-07-21 15:34:08,060 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_get_stats [2022-07-21 15:34:08,060 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_alloc_skb [2022-07-21 15:34:08,060 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_alloc_skb [2022-07-21 15:34:08,060 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-21 15:34:08,060 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-21 15:34:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 15:34:08,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 15:34:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:34:08,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:34:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-21 15:34:08,061 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-21 15:34:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:34:08,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:34:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_irq_restore [2022-07-21 15:34:08,062 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_irq_restore [2022-07-21 15:34:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-07-21 15:34:08,062 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-07-21 15:34:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-21 15:34:08,062 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-21 15:34:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:34:08,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:34:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_amd8111e_priv [2022-07-21 15:34:08,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_amd8111e_priv [2022-07-21 15:34:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:34:08,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:34:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure pci_get_drvdata [2022-07-21 15:34:08,063 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_get_drvdata [2022-07-21 15:34:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-21 15:34:08,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-21 15:34:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-21 15:34:08,064 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-21 15:34:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-07-21 15:34:08,064 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-07-21 15:34:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-21 15:34:08,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-21 15:34:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure arch_irqs_disabled_flags [2022-07-21 15:34:08,065 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_irqs_disabled_flags [2022-07-21 15:34:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:34:08,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:34:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_single [2022-07-21 15:34:08,065 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_single [2022-07-21 15:34:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 15:34:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer_sync [2022-07-21 15:34:08,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer_sync [2022-07-21 15:34:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_tx_timeout [2022-07-21 15:34:08,066 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_tx_timeout [2022-07-21 15:34:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:34:08,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:34:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-21 15:34:08,066 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-21 15:34:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_mdio_read [2022-07-21 15:34:08,066 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_mdio_read [2022-07-21 15:34:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 15:34:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_nway_reset [2022-07-21 15:34:08,067 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_nway_reset [2022-07-21 15:34:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-21 15:34:08,067 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-21 15:34:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_set_rx_buff_len [2022-07-21 15:34:08,068 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_set_rx_buff_len [2022-07-21 15:34:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 15:34:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-21 15:34:08,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-21 15:34:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_open [2022-07-21 15:34:08,068 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_open [2022-07-21 15:34:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-21 15:34:08,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-21 15:34:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:34:08,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:34:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 15:34:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:34:08,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:34:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-21 15:34:08,072 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-21 15:34:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:34:08,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:34:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-07-21 15:34:08,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-07-21 15:34:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-21 15:34:08,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-21 15:34:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-21 15:34:08,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-21 15:34:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-07-21 15:34:08,075 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-07-21 15:34:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:34:08,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:34:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_129 [2022-07-21 15:34:08,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_129 [2022-07-21 15:34:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-21 15:34:08,075 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-21 15:34:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_write_phy [2022-07-21 15:34:08,076 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_write_phy [2022-07-21 15:34:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:34:08,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:34:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 15:34:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_read_phy [2022-07-21 15:34:08,077 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_read_phy [2022-07-21 15:34:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer [2022-07-21 15:34:08,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer [2022-07-21 15:34:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 15:34:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 15:34:08,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 15:34:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-21 15:34:08,078 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-21 15:34:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 15:34:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 15:34:08,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 15:34:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-21 15:34:08,081 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-21 15:34:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_remove_one [2022-07-21 15:34:08,081 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_remove_one [2022-07-21 15:34:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure napi_disable [2022-07-21 15:34:08,081 INFO L138 BoogieDeclarations]: Found implementation of procedure napi_disable [2022-07-21 15:34:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-21 15:34:08,082 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-21 15:34:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_free_skbs [2022-07-21 15:34:08,082 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_free_skbs [2022-07-21 15:34:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:34:08,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:34:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-21 15:34:08,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-21 15:34:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-21 15:34:08,083 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-21 15:34:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure writeb [2022-07-21 15:34:08,083 INFO L138 BoogieDeclarations]: Found implementation of procedure writeb [2022-07-21 15:34:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure writew [2022-07-21 15:34:08,084 INFO L138 BoogieDeclarations]: Found implementation of procedure writew [2022-07-21 15:34:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_save_flags [2022-07-21 15:34:08,084 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_save_flags [2022-07-21 15:34:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 15:34:08,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 15:34:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_close [2022-07-21 15:34:08,084 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_close [2022-07-21 15:34:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 15:34:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 15:34:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 15:34:08,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 15:34:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:34:08,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:34:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2022-07-21 15:34:08,085 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2022-07-21 15:34:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_mdio_write [2022-07-21 15:34:08,085 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_mdio_write [2022-07-21 15:34:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_read_mib [2022-07-21 15:34:08,086 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_read_mib [2022-07-21 15:34:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-07-21 15:34:08,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-07-21 15:34:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_interrupt [2022-07-21 15:34:08,086 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_interrupt [2022-07-21 15:34:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure pci_map_single [2022-07-21 15:34:08,086 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_map_single [2022-07-21 15:34:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_set_coalesce [2022-07-21 15:34:08,087 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_set_coalesce [2022-07-21 15:34:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-21 15:34:08,087 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-21 15:34:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_122 [2022-07-21 15:34:08,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_122 [2022-07-21 15:34:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2022-07-21 15:34:08,087 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2022-07-21 15:34:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:34:08,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:34:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:34:08,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:34:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-21 15:34:08,088 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-21 15:34:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure netif_start_queue [2022-07-21 15:34:08,088 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_start_queue [2022-07-21 15:34:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 15:34:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:34:08,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:34:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure trace_hardirqs_off [2022-07-21 15:34:08,089 INFO L138 BoogieDeclarations]: Found implementation of procedure trace_hardirqs_off [2022-07-21 15:34:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-21 15:34:08,089 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-21 15:34:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 15:34:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_amd8111e_priv [2022-07-21 15:34:08,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_amd8111e_priv [2022-07-21 15:34:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_disable_interrupt [2022-07-21 15:34:08,090 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_disable_interrupt [2022-07-21 15:34:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure pci_enable_wake [2022-07-21 15:34:08,090 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_enable_wake [2022-07-21 15:34:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_set_multicast_list [2022-07-21 15:34:08,090 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_set_multicast_list [2022-07-21 15:34:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 15:34:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_resume [2022-07-21 15:34:08,091 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_resume [2022-07-21 15:34:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:34:08,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:34:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-21 15:34:08,091 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-21 15:34:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-21 15:34:08,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-21 15:34:08,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-21 15:34:08,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-21 15:34:08,092 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_restart [2022-07-21 15:34:08,092 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_restart [2022-07-21 15:34:08,092 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-21 15:34:08,092 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-21 15:34:08,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:34:08,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:34:08,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:34:08,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:34:08,093 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-21 15:34:08,093 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-21 15:34:08,093 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-21 15:34:08,093 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-21 15:34:08,093 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-21 15:34:08,093 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-21 15:34:08,093 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-21 15:34:08,094 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-21 15:34:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:34:08,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:34:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 15:34:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:34:08,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:34:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 15:34:08,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 15:34:08,095 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_stop_chip [2022-07-21 15:34:08,095 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_stop_chip [2022-07-21 15:34:08,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:34:08,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:34:08,095 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_poll [2022-07-21 15:34:08,095 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_poll [2022-07-21 15:34:08,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-21 15:34:08,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-21 15:34:08,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:34:08,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:34:08,096 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_power_state [2022-07-21 15:34:08,096 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_set_power_state [2022-07-21 15:34:08,096 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_get_regs_len [2022-07-21 15:34:08,096 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_get_regs_len [2022-07-21 15:34:08,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_127 [2022-07-21 15:34:08,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_127 [2022-07-21 15:34:08,096 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-21 15:34:08,097 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-21 15:34:08,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 15:34:08,893 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 15:34:08,896 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 15:34:09,356 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 15:34:11,244 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 15:34:11,259 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 15:34:11,259 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 15:34:11,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:34:11 BoogieIcfgContainer [2022-07-21 15:34:11,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 15:34:11,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 15:34:11,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 15:34:11,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 15:34:11,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:34:03" (1/3) ... [2022-07-21 15:34:11,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6c2ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:34:11, skipping insertion in model container [2022-07-21 15:34:11,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:34:07" (2/3) ... [2022-07-21 15:34:11,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6c2ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:34:11, skipping insertion in model container [2022-07-21 15:34:11,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:34:11" (3/3) ... [2022-07-21 15:34:11,268 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i [2022-07-21 15:34:11,280 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 15:34:11,280 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-07-21 15:34:11,360 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 15:34:11,368 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d8e2e92, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4f58e2ab [2022-07-21 15:34:11,368 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-07-21 15:34:11,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 1881 states, 1230 states have (on average 1.283739837398374) internal successors, (1579), 1293 states have internal predecessors, (1579), 512 states have call successors, (512), 112 states have call predecessors, (512), 111 states have return successors, (508), 499 states have call predecessors, (508), 508 states have call successors, (508) [2022-07-21 15:34:11,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-21 15:34:11,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:34:11,389 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:34:11,389 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:34:11,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:34:11,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1030412295, now seen corresponding path program 1 times [2022-07-21 15:34:11,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:34:11,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590148494] [2022-07-21 15:34:11,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:34:11,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:34:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:12,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:34:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:12,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:34:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:12,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:34:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:12,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:34:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:12,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:34:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:12,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:34:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:12,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:12,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:34:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:12,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:34:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:34:12,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:34:12,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590148494] [2022-07-21 15:34:12,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590148494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:34:12,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:34:12,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:34:12,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143866453] [2022-07-21 15:34:12,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:34:12,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:34:12,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:34:12,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:34:12,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:34:12,182 INFO L87 Difference]: Start difference. First operand has 1881 states, 1230 states have (on average 1.283739837398374) internal successors, (1579), 1293 states have internal predecessors, (1579), 512 states have call successors, (512), 112 states have call predecessors, (512), 111 states have return successors, (508), 499 states have call predecessors, (508), 508 states have call successors, (508) Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (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) [2022-07-21 15:34:16,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:34:16,261 INFO L93 Difference]: Finished difference Result 3729 states and 5275 transitions. [2022-07-21 15:34:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:34:16,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (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 64 [2022-07-21 15:34:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:34:16,293 INFO L225 Difference]: With dead ends: 3729 [2022-07-21 15:34:16,293 INFO L226 Difference]: Without dead ends: 1863 [2022-07-21 15:34:16,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:34:16,316 INFO L413 NwaCegarLoop]: 2195 mSDtfsCounter, 3760 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 2579 mSolverCounterSat, 2314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3937 SdHoareTripleChecker+Valid, 3739 SdHoareTripleChecker+Invalid, 4893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2314 IncrementalHoareTripleChecker+Valid, 2579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:34:16,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3937 Valid, 3739 Invalid, 4893 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2314 Valid, 2579 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-21 15:34:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2022-07-21 15:34:16,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1863. [2022-07-21 15:34:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1863 states, 1219 states have (on average 1.2223133716160788) internal successors, (1490), 1279 states have internal predecessors, (1490), 508 states have call successors, (508), 111 states have call predecessors, (508), 110 states have return successors, (506), 497 states have call predecessors, (506), 506 states have call successors, (506) [2022-07-21 15:34:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 2504 transitions. [2022-07-21 15:34:16,506 INFO L78 Accepts]: Start accepts. Automaton has 1863 states and 2504 transitions. Word has length 64 [2022-07-21 15:34:16,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:34:16,508 INFO L495 AbstractCegarLoop]: Abstraction has 1863 states and 2504 transitions. [2022-07-21 15:34:16,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (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) [2022-07-21 15:34:16,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2504 transitions. [2022-07-21 15:34:16,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-21 15:34:16,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:34:16,517 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:34:16,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 15:34:16,518 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:34:16,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:34:16,518 INFO L85 PathProgramCache]: Analyzing trace with hash -931920879, now seen corresponding path program 1 times [2022-07-21 15:34:16,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:34:16,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326411955] [2022-07-21 15:34:16,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:34:16,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:34:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:16,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:34:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:16,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:34:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:16,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:34:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:16,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:34:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:16,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:34:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:16,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:34:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:16,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:16,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:34:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:16,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:34:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:16,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:34:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:34:16,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:34:16,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326411955] [2022-07-21 15:34:16,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326411955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:34:16,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:34:16,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:34:16,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472463833] [2022-07-21 15:34:16,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:34:16,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:34:16,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:34:16,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:34:16,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:34:16,850 INFO L87 Difference]: Start difference. First operand 1863 states and 2504 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (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) [2022-07-21 15:34:20,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:34:20,314 INFO L93 Difference]: Finished difference Result 1863 states and 2504 transitions. [2022-07-21 15:34:20,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:34:20,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (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 70 [2022-07-21 15:34:20,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:34:20,326 INFO L225 Difference]: With dead ends: 1863 [2022-07-21 15:34:20,326 INFO L226 Difference]: Without dead ends: 1861 [2022-07-21 15:34:20,327 INFO L412 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 [2022-07-21 15:34:20,328 INFO L413 NwaCegarLoop]: 2177 mSDtfsCounter, 3728 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 2565 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3902 SdHoareTripleChecker+Valid, 3705 SdHoareTripleChecker+Invalid, 4871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:34:20,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3902 Valid, 3705 Invalid, 4871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2565 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-21 15:34:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2022-07-21 15:34:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1861. [2022-07-21 15:34:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1861 states, 1218 states have (on average 1.2216748768472907) internal successors, (1488), 1277 states have internal predecessors, (1488), 508 states have call successors, (508), 111 states have call predecessors, (508), 110 states have return successors, (506), 497 states have call predecessors, (506), 506 states have call successors, (506) [2022-07-21 15:34:20,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1861 states and 2502 transitions. [2022-07-21 15:34:20,403 INFO L78 Accepts]: Start accepts. Automaton has 1861 states and 2502 transitions. Word has length 70 [2022-07-21 15:34:20,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:34:20,405 INFO L495 AbstractCegarLoop]: Abstraction has 1861 states and 2502 transitions. [2022-07-21 15:34:20,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (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) [2022-07-21 15:34:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 2502 transitions. [2022-07-21 15:34:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-21 15:34:20,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:34:20,409 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:34:20,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 15:34:20,410 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:34:20,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:34:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1623667506, now seen corresponding path program 1 times [2022-07-21 15:34:20,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:34:20,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090674338] [2022-07-21 15:34:20,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:34:20,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:34:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:20,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:34:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:20,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:34:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:20,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:34:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:20,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:34:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:20,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:34:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:20,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:34:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:20,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:20,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:34:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:20,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:34:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:20,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:34:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:20,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:34:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:34:20,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:34:20,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090674338] [2022-07-21 15:34:20,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090674338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:34:20,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:34:20,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:34:20,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274554686] [2022-07-21 15:34:20,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:34:20,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:34:20,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:34:20,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:34:20,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:34:20,685 INFO L87 Difference]: Start difference. First operand 1861 states and 2502 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, (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) [2022-07-21 15:34:24,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:34:24,003 INFO L93 Difference]: Finished difference Result 1861 states and 2502 transitions. [2022-07-21 15:34:24,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:34:24,003 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, (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 76 [2022-07-21 15:34:24,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:34:24,014 INFO L225 Difference]: With dead ends: 1861 [2022-07-21 15:34:24,014 INFO L226 Difference]: Without dead ends: 1859 [2022-07-21 15:34:24,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:34:24,015 INFO L413 NwaCegarLoop]: 2175 mSDtfsCounter, 3722 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 2563 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3895 SdHoareTripleChecker+Valid, 3703 SdHoareTripleChecker+Invalid, 4869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:34:24,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3895 Valid, 3703 Invalid, 4869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2563 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-21 15:34:24,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2022-07-21 15:34:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1859. [2022-07-21 15:34:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1217 states have (on average 1.221035332785538) internal successors, (1486), 1275 states have internal predecessors, (1486), 508 states have call successors, (508), 111 states have call predecessors, (508), 110 states have return successors, (506), 497 states have call predecessors, (506), 506 states have call successors, (506) [2022-07-21 15:34:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2500 transitions. [2022-07-21 15:34:24,085 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2500 transitions. Word has length 76 [2022-07-21 15:34:24,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:34:24,085 INFO L495 AbstractCegarLoop]: Abstraction has 1859 states and 2500 transitions. [2022-07-21 15:34:24,085 INFO L496 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, (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) [2022-07-21 15:34:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2500 transitions. [2022-07-21 15:34:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-21 15:34:24,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:34:24,086 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:34:24,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 15:34:24,087 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:34:24,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:34:24,087 INFO L85 PathProgramCache]: Analyzing trace with hash -556418011, now seen corresponding path program 1 times [2022-07-21 15:34:24,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:34:24,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663547118] [2022-07-21 15:34:24,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:34:24,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:34:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:24,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:34:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:24,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:34:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:24,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:34:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:24,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:34:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:24,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:34:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:24,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:34:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:24,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:24,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:34:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:24,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:34:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:24,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:34:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:34:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:24,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:34:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:34:24,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:34:24,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663547118] [2022-07-21 15:34:24,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663547118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:34:24,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:34:24,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:34:24,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577883842] [2022-07-21 15:34:24,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:34:24,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:34:24,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:34:24,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:34:24,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:34:24,321 INFO L87 Difference]: Start difference. First operand 1859 states and 2500 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (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) [2022-07-21 15:34:27,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:34:27,278 INFO L93 Difference]: Finished difference Result 1859 states and 2500 transitions. [2022-07-21 15:34:27,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:34:27,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (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 82 [2022-07-21 15:34:27,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:34:27,291 INFO L225 Difference]: With dead ends: 1859 [2022-07-21 15:34:27,291 INFO L226 Difference]: Without dead ends: 1857 [2022-07-21 15:34:27,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:34:27,295 INFO L413 NwaCegarLoop]: 2173 mSDtfsCounter, 3716 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 2561 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3888 SdHoareTripleChecker+Valid, 3701 SdHoareTripleChecker+Invalid, 4867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:34:27,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3888 Valid, 3701 Invalid, 4867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2561 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-21 15:34:27,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2022-07-21 15:34:27,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1857. [2022-07-21 15:34:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1216 states have (on average 1.2203947368421053) internal successors, (1484), 1273 states have internal predecessors, (1484), 508 states have call successors, (508), 111 states have call predecessors, (508), 110 states have return successors, (506), 497 states have call predecessors, (506), 506 states have call successors, (506) [2022-07-21 15:34:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2498 transitions. [2022-07-21 15:34:27,374 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2498 transitions. Word has length 82 [2022-07-21 15:34:27,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:34:27,375 INFO L495 AbstractCegarLoop]: Abstraction has 1857 states and 2498 transitions. [2022-07-21 15:34:27,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (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) [2022-07-21 15:34:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2498 transitions. [2022-07-21 15:34:27,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-21 15:34:27,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:34:27,376 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:34:27,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 15:34:27,377 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:34:27,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:34:27,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2061808673, now seen corresponding path program 1 times [2022-07-21 15:34:27,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:34:27,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279399455] [2022-07-21 15:34:27,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:34:27,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:34:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:27,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:34:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:27,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:34:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:27,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:34:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:27,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:34:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:27,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:34:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:27,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:34:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:27,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:27,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:34:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:27,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:34:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:27,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:34:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:27,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:34:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:27,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:34:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:27,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:34:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:34:27,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:34:27,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279399455] [2022-07-21 15:34:27,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279399455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:34:27,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:34:27,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:34:27,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058149143] [2022-07-21 15:34:27,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:34:27,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:34:27,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:34:27,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:34:27,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:34:27,655 INFO L87 Difference]: Start difference. First operand 1857 states and 2498 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, (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) [2022-07-21 15:34:30,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:34:30,624 INFO L93 Difference]: Finished difference Result 1857 states and 2498 transitions. [2022-07-21 15:34:30,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:34:30,625 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, (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 88 [2022-07-21 15:34:30,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:34:30,634 INFO L225 Difference]: With dead ends: 1857 [2022-07-21 15:34:30,634 INFO L226 Difference]: Without dead ends: 1855 [2022-07-21 15:34:30,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:34:30,636 INFO L413 NwaCegarLoop]: 2171 mSDtfsCounter, 3710 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3881 SdHoareTripleChecker+Valid, 3699 SdHoareTripleChecker+Invalid, 4865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:34:30,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3881 Valid, 3699 Invalid, 4865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-21 15:34:30,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2022-07-21 15:34:30,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1855. [2022-07-21 15:34:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1855 states, 1215 states have (on average 1.219753086419753) internal successors, (1482), 1271 states have internal predecessors, (1482), 508 states have call successors, (508), 111 states have call predecessors, (508), 110 states have return successors, (506), 497 states have call predecessors, (506), 506 states have call successors, (506) [2022-07-21 15:34:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 2496 transitions. [2022-07-21 15:34:30,706 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 2496 transitions. Word has length 88 [2022-07-21 15:34:30,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:34:30,707 INFO L495 AbstractCegarLoop]: Abstraction has 1855 states and 2496 transitions. [2022-07-21 15:34:30,707 INFO L496 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, (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) [2022-07-21 15:34:30,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2496 transitions. [2022-07-21 15:34:30,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-21 15:34:30,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:34:30,713 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:34:30,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 15:34:30,714 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:34:30,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:34:30,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1388539049, now seen corresponding path program 1 times [2022-07-21 15:34:30,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:34:30,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333790736] [2022-07-21 15:34:30,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:34:30,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:34:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:34:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:34:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:34:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:34:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:34:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:34:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:34:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:34:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:34:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-21 15:34:30,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:34:30,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333790736] [2022-07-21 15:34:30,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333790736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:34:30,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:34:30,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:34:30,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169035119] [2022-07-21 15:34:30,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:34:30,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:34:30,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:34:30,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:34:30,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:34:30,965 INFO L87 Difference]: Start difference. First operand 1855 states and 2496 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:34:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:34:36,244 INFO L93 Difference]: Finished difference Result 5088 states and 6882 transitions. [2022-07-21 15:34:36,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 15:34:36,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2022-07-21 15:34:36,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:34:36,260 INFO L225 Difference]: With dead ends: 5088 [2022-07-21 15:34:36,260 INFO L226 Difference]: Without dead ends: 3254 [2022-07-21 15:34:36,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-21 15:34:36,268 INFO L413 NwaCegarLoop]: 2611 mSDtfsCounter, 6266 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 3814 mSolverCounterSat, 4447 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6455 SdHoareTripleChecker+Valid, 4957 SdHoareTripleChecker+Invalid, 8261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4447 IncrementalHoareTripleChecker+Valid, 3814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:34:36,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6455 Valid, 4957 Invalid, 8261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4447 Valid, 3814 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-21 15:34:36,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2022-07-21 15:34:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 3106. [2022-07-21 15:34:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 2048 states have (on average 1.22314453125) internal successors, (2505), 2128 states have internal predecessors, (2505), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-21 15:34:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 4205 transitions. [2022-07-21 15:34:36,452 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 4205 transitions. Word has length 110 [2022-07-21 15:34:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:34:36,453 INFO L495 AbstractCegarLoop]: Abstraction has 3106 states and 4205 transitions. [2022-07-21 15:34:36,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:34:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 4205 transitions. [2022-07-21 15:34:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 15:34:36,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:34:36,454 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:34:36,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 15:34:36,455 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:34:36,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:34:36,455 INFO L85 PathProgramCache]: Analyzing trace with hash 31811044, now seen corresponding path program 1 times [2022-07-21 15:34:36,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:34:36,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564123511] [2022-07-21 15:34:36,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:34:36,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:34:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:36,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:34:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:36,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:34:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:36,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:34:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:36,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:34:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:36,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:34:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:36,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:34:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:36,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:36,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:34:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:36,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:34:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:36,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:34:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:36,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:34:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:36,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:34:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:36,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:34:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:36,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:34:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:34:36,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:34:36,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564123511] [2022-07-21 15:34:36,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564123511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:34:36,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:34:36,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:34:36,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111766270] [2022-07-21 15:34:36,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:34:36,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:34:36,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:34:36,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:34:36,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:34:36,703 INFO L87 Difference]: Start difference. First operand 3106 states and 4205 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (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) [2022-07-21 15:34:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:34:39,816 INFO L93 Difference]: Finished difference Result 3106 states and 4205 transitions. [2022-07-21 15:34:39,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:34:39,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (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 94 [2022-07-21 15:34:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:34:39,829 INFO L225 Difference]: With dead ends: 3106 [2022-07-21 15:34:39,829 INFO L226 Difference]: Without dead ends: 3104 [2022-07-21 15:34:39,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:34:39,831 INFO L413 NwaCegarLoop]: 2169 mSDtfsCounter, 3704 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 2557 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3874 SdHoareTripleChecker+Valid, 3697 SdHoareTripleChecker+Invalid, 4863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:34:39,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3874 Valid, 3697 Invalid, 4863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2557 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-21 15:34:39,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3104 states. [2022-07-21 15:34:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3104 to 3104. [2022-07-21 15:34:39,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3104 states, 2047 states have (on average 1.2227650219833903) internal successors, (2503), 2126 states have internal predecessors, (2503), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-21 15:34:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 4203 transitions. [2022-07-21 15:34:39,983 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 4203 transitions. Word has length 94 [2022-07-21 15:34:39,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:34:39,984 INFO L495 AbstractCegarLoop]: Abstraction has 3104 states and 4203 transitions. [2022-07-21 15:34:39,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (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) [2022-07-21 15:34:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 4203 transitions. [2022-07-21 15:34:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-21 15:34:39,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:34:39,986 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-21 15:34:39,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 15:34:39,986 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:34:39,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:34:39,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1694689272, now seen corresponding path program 1 times [2022-07-21 15:34:39,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:34:39,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531623367] [2022-07-21 15:34:39,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:34:39,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:34:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:34:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:34:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:34:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:34:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:34:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:34:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:34:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:34:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:34:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 15:34:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-21 15:34:40,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:34:40,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531623367] [2022-07-21 15:34:40,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531623367] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:34:40,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914238482] [2022-07-21 15:34:40,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:34:40,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:34:40,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:34:40,239 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) [2022-07-21 15:34:40,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 15:34:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:40,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 1709 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 15:34:40,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:34:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-21 15:34:41,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:34:41,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914238482] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:34:41,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:34:41,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-21 15:34:41,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395499785] [2022-07-21 15:34:41,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:34:41,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 15:34:41,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:34:41,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 15:34:41,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:34:41,053 INFO L87 Difference]: Start difference. First operand 3104 states and 4203 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:34:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:34:41,240 INFO L93 Difference]: Finished difference Result 6183 states and 8371 transitions. [2022-07-21 15:34:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 15:34:41,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2022-07-21 15:34:41,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:34:41,257 INFO L225 Difference]: With dead ends: 6183 [2022-07-21 15:34:41,258 INFO L226 Difference]: Without dead ends: 3100 [2022-07-21 15:34:41,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:34:41,271 INFO L413 NwaCegarLoop]: 2488 mSDtfsCounter, 2472 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2472 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:34:41,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2472 Valid, 2488 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 15:34:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2022-07-21 15:34:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3100. [2022-07-21 15:34:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 2044 states have (on average 1.2221135029354206) internal successors, (2498), 2122 states have internal predecessors, (2498), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-21 15:34:41,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4198 transitions. [2022-07-21 15:34:41,436 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4198 transitions. Word has length 116 [2022-07-21 15:34:41,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:34:41,437 INFO L495 AbstractCegarLoop]: Abstraction has 3100 states and 4198 transitions. [2022-07-21 15:34:41,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:34:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4198 transitions. [2022-07-21 15:34:41,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-21 15:34:41,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:34:41,440 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:34:41,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 15:34:41,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:34:41,655 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:34:41,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:34:41,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1132303691, now seen corresponding path program 1 times [2022-07-21 15:34:41,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:34:41,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234871658] [2022-07-21 15:34:41,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:34:41,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:34:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:41,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:34:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:41,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:34:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:41,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:34:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:41,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:34:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:41,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:34:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:41,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:34:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:41,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:41,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:34:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:41,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:34:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:41,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:34:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:41,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:34:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:41,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:34:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:41,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:34:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:41,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:34:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:41,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:34:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:34:41,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:34:41,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234871658] [2022-07-21 15:34:41,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234871658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:34:41,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:34:41,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:34:41,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914253662] [2022-07-21 15:34:41,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:34:41,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:34:41,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:34:41,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:34:41,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:34:41,888 INFO L87 Difference]: Start difference. First operand 3100 states and 4198 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (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) [2022-07-21 15:34:44,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:34:44,986 INFO L93 Difference]: Finished difference Result 3100 states and 4198 transitions. [2022-07-21 15:34:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:34:44,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (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 100 [2022-07-21 15:34:44,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:34:44,998 INFO L225 Difference]: With dead ends: 3100 [2022-07-21 15:34:44,999 INFO L226 Difference]: Without dead ends: 3098 [2022-07-21 15:34:45,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:34:45,001 INFO L413 NwaCegarLoop]: 2162 mSDtfsCounter, 3693 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3862 SdHoareTripleChecker+Valid, 3676 SdHoareTripleChecker+Invalid, 4860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:34:45,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3862 Valid, 3676 Invalid, 4860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-21 15:34:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2022-07-21 15:34:45,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 3098. [2022-07-21 15:34:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 2043 states have (on average 1.2217327459618208) internal successors, (2496), 2120 states have internal predecessors, (2496), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-21 15:34:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4196 transitions. [2022-07-21 15:34:45,155 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4196 transitions. Word has length 100 [2022-07-21 15:34:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:34:45,155 INFO L495 AbstractCegarLoop]: Abstraction has 3098 states and 4196 transitions. [2022-07-21 15:34:45,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (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) [2022-07-21 15:34:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4196 transitions. [2022-07-21 15:34:45,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-21 15:34:45,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:34:45,157 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:34:45,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 15:34:45,158 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:34:45,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:34:45,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1737552029, now seen corresponding path program 1 times [2022-07-21 15:34:45,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:34:45,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913944450] [2022-07-21 15:34:45,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:34:45,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:34:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:45,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:34:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:45,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:34:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:34:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:45,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:34:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:45,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:34:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:45,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:34:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:45,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:45,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:34:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:45,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:34:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:45,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:34:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:45,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:34:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:45,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:34:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:45,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:34:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:45,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:34:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:45,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:34:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:45,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:34:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:34:45,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:34:45,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913944450] [2022-07-21 15:34:45,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913944450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:34:45,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:34:45,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:34:45,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161343084] [2022-07-21 15:34:45,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:34:45,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:34:45,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:34:45,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:34:45,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:34:45,399 INFO L87 Difference]: Start difference. First operand 3098 states and 4196 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, (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) [2022-07-21 15:34:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:34:48,383 INFO L93 Difference]: Finished difference Result 3098 states and 4196 transitions. [2022-07-21 15:34:48,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:34:48,383 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, (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 106 [2022-07-21 15:34:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:34:48,395 INFO L225 Difference]: With dead ends: 3098 [2022-07-21 15:34:48,395 INFO L226 Difference]: Without dead ends: 3096 [2022-07-21 15:34:48,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:34:48,397 INFO L413 NwaCegarLoop]: 2160 mSDtfsCounter, 3691 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2548 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3859 SdHoareTripleChecker+Valid, 3674 SdHoareTripleChecker+Invalid, 4854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:34:48,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3859 Valid, 3674 Invalid, 4854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2548 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-21 15:34:48,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2022-07-21 15:34:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 3096. [2022-07-21 15:34:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3096 states, 2042 states have (on average 1.2213516160626836) internal successors, (2494), 2118 states have internal predecessors, (2494), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-21 15:34:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 4194 transitions. [2022-07-21 15:34:48,613 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 4194 transitions. Word has length 106 [2022-07-21 15:34:48,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:34:48,614 INFO L495 AbstractCegarLoop]: Abstraction has 3096 states and 4194 transitions. [2022-07-21 15:34:48,614 INFO L496 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, (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) [2022-07-21 15:34:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 4194 transitions. [2022-07-21 15:34:48,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-21 15:34:48,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:34:48,617 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:34:48,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 15:34:48,618 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:34:48,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:34:48,619 INFO L85 PathProgramCache]: Analyzing trace with hash 954930630, now seen corresponding path program 1 times [2022-07-21 15:34:48,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:34:48,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869825353] [2022-07-21 15:34:48,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:34:48,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:34:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:48,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:34:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:48,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:34:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:48,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:34:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:48,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:34:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:48,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:34:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:48,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:34:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:48,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:48,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:34:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:48,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:34:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:48,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:34:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:48,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:34:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:48,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:34:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:48,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:34:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:48,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:34:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:48,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:34:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:48,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:34:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:34:48,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:34:48,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869825353] [2022-07-21 15:34:48,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869825353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:34:48,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:34:48,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:34:48,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589017001] [2022-07-21 15:34:48,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:34:48,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:34:48,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:34:48,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:34:48,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:34:48,803 INFO L87 Difference]: Start difference. First operand 3096 states and 4194 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (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) [2022-07-21 15:34:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:34:51,742 INFO L93 Difference]: Finished difference Result 3096 states and 4194 transitions. [2022-07-21 15:34:51,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:34:51,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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 108 [2022-07-21 15:34:51,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:34:51,758 INFO L225 Difference]: With dead ends: 3096 [2022-07-21 15:34:51,758 INFO L226 Difference]: Without dead ends: 3094 [2022-07-21 15:34:51,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:34:51,760 INFO L413 NwaCegarLoop]: 2158 mSDtfsCounter, 3679 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3847 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 4856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:34:51,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3847 Valid, 3672 Invalid, 4856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-21 15:34:51,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2022-07-21 15:34:51,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3094. [2022-07-21 15:34:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3094 states, 2041 states have (on average 1.220970112689858) internal successors, (2492), 2116 states have internal predecessors, (2492), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-21 15:34:51,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 4192 transitions. [2022-07-21 15:34:51,946 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 4192 transitions. Word has length 108 [2022-07-21 15:34:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:34:51,948 INFO L495 AbstractCegarLoop]: Abstraction has 3094 states and 4192 transitions. [2022-07-21 15:34:51,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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) [2022-07-21 15:34:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 4192 transitions. [2022-07-21 15:34:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-21 15:34:51,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:34:51,950 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:34:51,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 15:34:51,950 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:34:51,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:34:51,951 INFO L85 PathProgramCache]: Analyzing trace with hash 109086248, now seen corresponding path program 1 times [2022-07-21 15:34:51,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:34:51,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052938760] [2022-07-21 15:34:51,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:34:51,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:34:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:34:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:34:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:34:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:34:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:34:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:34:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:34:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:34:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:34:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:34:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:34:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:34:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:34:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:34:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:34:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:34:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:34:52,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:34:52,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052938760] [2022-07-21 15:34:52,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052938760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:34:52,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:34:52,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:34:52,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427985900] [2022-07-21 15:34:52,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:34:52,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:34:52,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:34:52,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:34:52,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:34:52,171 INFO L87 Difference]: Start difference. First operand 3094 states and 4192 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, (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) [2022-07-21 15:34:55,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:34:55,112 INFO L93 Difference]: Finished difference Result 3094 states and 4192 transitions. [2022-07-21 15:34:55,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:34:55,112 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, (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 114 [2022-07-21 15:34:55,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:34:55,125 INFO L225 Difference]: With dead ends: 3094 [2022-07-21 15:34:55,125 INFO L226 Difference]: Without dead ends: 3092 [2022-07-21 15:34:55,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:34:55,160 INFO L413 NwaCegarLoop]: 2156 mSDtfsCounter, 3675 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2548 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3842 SdHoareTripleChecker+Valid, 3670 SdHoareTripleChecker+Invalid, 4854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:34:55,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3842 Valid, 3670 Invalid, 4854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2548 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-21 15:34:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2022-07-21 15:34:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 3092. [2022-07-21 15:34:55,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3092 states, 2040 states have (on average 1.2205882352941178) internal successors, (2490), 2114 states have internal predecessors, (2490), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-21 15:34:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4190 transitions. [2022-07-21 15:34:55,312 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4190 transitions. Word has length 114 [2022-07-21 15:34:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:34:55,313 INFO L495 AbstractCegarLoop]: Abstraction has 3092 states and 4190 transitions. [2022-07-21 15:34:55,313 INFO L496 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, (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) [2022-07-21 15:34:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4190 transitions. [2022-07-21 15:34:55,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-21 15:34:55,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:34:55,315 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:34:55,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 15:34:55,315 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:34:55,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:34:55,316 INFO L85 PathProgramCache]: Analyzing trace with hash 401789871, now seen corresponding path program 1 times [2022-07-21 15:34:55,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:34:55,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683612434] [2022-07-21 15:34:55,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:34:55,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:34:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:34:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:34:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:34:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:34:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:34:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:34:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:34:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:34:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:34:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:34:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:34:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:34:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:34:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:34:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:34:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:34:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:34:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:55,564 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:34:55,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:34:55,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683612434] [2022-07-21 15:34:55,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683612434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:34:55,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:34:55,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:34:55,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816967325] [2022-07-21 15:34:55,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:34:55,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:34:55,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:34:55,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:34:55,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:34:55,567 INFO L87 Difference]: Start difference. First operand 3092 states and 4190 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2022-07-21 15:34:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:34:58,760 INFO L93 Difference]: Finished difference Result 3092 states and 4190 transitions. [2022-07-21 15:34:58,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:34:58,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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 120 [2022-07-21 15:34:58,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:34:58,770 INFO L225 Difference]: With dead ends: 3092 [2022-07-21 15:34:58,770 INFO L226 Difference]: Without dead ends: 3090 [2022-07-21 15:34:58,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:34:58,772 INFO L413 NwaCegarLoop]: 2154 mSDtfsCounter, 3669 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2546 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3835 SdHoareTripleChecker+Valid, 3668 SdHoareTripleChecker+Invalid, 4852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:34:58,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3835 Valid, 3668 Invalid, 4852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2546 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-21 15:34:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2022-07-21 15:34:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 3090. [2022-07-21 15:34:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3090 states, 2039 states have (on average 1.2202059833251593) internal successors, (2488), 2112 states have internal predecessors, (2488), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-21 15:34:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 4188 transitions. [2022-07-21 15:34:58,913 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 4188 transitions. Word has length 120 [2022-07-21 15:34:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:34:58,914 INFO L495 AbstractCegarLoop]: Abstraction has 3090 states and 4188 transitions. [2022-07-21 15:34:58,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2022-07-21 15:34:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 4188 transitions. [2022-07-21 15:34:58,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-21 15:34:58,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:34:58,916 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:34:58,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 15:34:58,916 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:34:58,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:34:58,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1246102120, now seen corresponding path program 1 times [2022-07-21 15:34:58,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:34:58,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455513986] [2022-07-21 15:34:58,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:34:58,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:34:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:34:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:34:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:34:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:34:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:34:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:34:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:34:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:34:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:34:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:34:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:34:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:34:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:34:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:34:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:34:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:34:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:34:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:34:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:34:59,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:34:59,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455513986] [2022-07-21 15:34:59,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455513986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:34:59,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:34:59,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:34:59,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567600539] [2022-07-21 15:34:59,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:34:59,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:34:59,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:34:59,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:34:59,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:34:59,110 INFO L87 Difference]: Start difference. First operand 3090 states and 4188 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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) [2022-07-21 15:35:02,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:35:02,249 INFO L93 Difference]: Finished difference Result 3090 states and 4188 transitions. [2022-07-21 15:35:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:35:02,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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 126 [2022-07-21 15:35:02,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:35:02,257 INFO L225 Difference]: With dead ends: 3090 [2022-07-21 15:35:02,257 INFO L226 Difference]: Without dead ends: 3088 [2022-07-21 15:35:02,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:35:02,260 INFO L413 NwaCegarLoop]: 2152 mSDtfsCounter, 3663 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2544 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3828 SdHoareTripleChecker+Valid, 3666 SdHoareTripleChecker+Invalid, 4850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:35:02,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3828 Valid, 3666 Invalid, 4850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2544 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-21 15:35:02,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2022-07-21 15:35:02,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 3088. [2022-07-21 15:35:02,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3088 states, 2038 states have (on average 1.2198233562315997) internal successors, (2486), 2110 states have internal predecessors, (2486), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-21 15:35:02,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 4186 transitions. [2022-07-21 15:35:02,387 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 4186 transitions. Word has length 126 [2022-07-21 15:35:02,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:35:02,387 INFO L495 AbstractCegarLoop]: Abstraction has 3088 states and 4186 transitions. [2022-07-21 15:35:02,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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) [2022-07-21 15:35:02,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 4186 transitions. [2022-07-21 15:35:02,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-21 15:35:02,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:35:02,390 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:35:02,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 15:35:02,390 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:35:02,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:35:02,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1745990219, now seen corresponding path program 1 times [2022-07-21 15:35:02,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:35:02,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184980597] [2022-07-21 15:35:02,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:35:02,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:35:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:35:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:35:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:35:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:35:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:35:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:35:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:35:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:35:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:35:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:35:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:35:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:35:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:35:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:35:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:35:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:35:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:35:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:35:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:35:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:35:02,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:35:02,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184980597] [2022-07-21 15:35:02,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184980597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:35:02,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:35:02,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:35:02,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369792273] [2022-07-21 15:35:02,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:35:02,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:35:02,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:35:02,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:35:02,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:35:02,615 INFO L87 Difference]: Start difference. First operand 3088 states and 4186 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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) [2022-07-21 15:35:05,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:35:05,781 INFO L93 Difference]: Finished difference Result 3088 states and 4186 transitions. [2022-07-21 15:35:05,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:35:05,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 132 [2022-07-21 15:35:05,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:35:05,793 INFO L225 Difference]: With dead ends: 3088 [2022-07-21 15:35:05,793 INFO L226 Difference]: Without dead ends: 3086 [2022-07-21 15:35:05,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:35:05,795 INFO L413 NwaCegarLoop]: 2150 mSDtfsCounter, 3657 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3821 SdHoareTripleChecker+Valid, 3664 SdHoareTripleChecker+Invalid, 4848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:35:05,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3821 Valid, 3664 Invalid, 4848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2542 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-21 15:35:05,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3086 states. [2022-07-21 15:35:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3086 to 3086. [2022-07-21 15:35:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 2037 states have (on average 1.2194403534609721) internal successors, (2484), 2108 states have internal predecessors, (2484), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-21 15:35:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 4184 transitions. [2022-07-21 15:35:05,959 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 4184 transitions. Word has length 132 [2022-07-21 15:35:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:35:05,960 INFO L495 AbstractCegarLoop]: Abstraction has 3086 states and 4184 transitions. [2022-07-21 15:35:05,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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) [2022-07-21 15:35:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 4184 transitions. [2022-07-21 15:35:05,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-21 15:35:05,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:35:05,962 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:35:05,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 15:35:05,963 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:35:05,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:35:05,963 INFO L85 PathProgramCache]: Analyzing trace with hash -472580401, now seen corresponding path program 1 times [2022-07-21 15:35:05,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:35:05,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862136966] [2022-07-21 15:35:05,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:35:05,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:35:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:35:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:35:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:35:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:35:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:35:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:35:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:35:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:35:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:35:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:35:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:35:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:35:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:35:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:35:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:35:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:35:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:35:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:35:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:35:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:35:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:06,194 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:35:06,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:35:06,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862136966] [2022-07-21 15:35:06,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862136966] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:35:06,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:35:06,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:35:06,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204872652] [2022-07-21 15:35:06,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:35:06,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:35:06,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:35:06,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:35:06,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:35:06,197 INFO L87 Difference]: Start difference. First operand 3086 states and 4184 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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) [2022-07-21 15:35:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:35:09,342 INFO L93 Difference]: Finished difference Result 3086 states and 4184 transitions. [2022-07-21 15:35:09,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:35:09,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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 138 [2022-07-21 15:35:09,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:35:09,351 INFO L225 Difference]: With dead ends: 3086 [2022-07-21 15:35:09,352 INFO L226 Difference]: Without dead ends: 3084 [2022-07-21 15:35:09,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:35:09,353 INFO L413 NwaCegarLoop]: 2148 mSDtfsCounter, 3651 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2540 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3814 SdHoareTripleChecker+Valid, 3662 SdHoareTripleChecker+Invalid, 4846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:35:09,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3814 Valid, 3662 Invalid, 4846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2540 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-21 15:35:09,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2022-07-21 15:35:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 3084. [2022-07-21 15:35:09,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3084 states, 2036 states have (on average 1.219056974459725) internal successors, (2482), 2106 states have internal predecessors, (2482), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-21 15:35:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 4182 transitions. [2022-07-21 15:35:09,525 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 4182 transitions. Word has length 138 [2022-07-21 15:35:09,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:35:09,527 INFO L495 AbstractCegarLoop]: Abstraction has 3084 states and 4182 transitions. [2022-07-21 15:35:09,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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) [2022-07-21 15:35:09,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 4182 transitions. [2022-07-21 15:35:09,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-21 15:35:09,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:35:09,530 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:35:09,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 15:35:09,530 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:35:09,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:35:09,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2085611573, now seen corresponding path program 1 times [2022-07-21 15:35:09,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:35:09,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738736157] [2022-07-21 15:35:09,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:35:09,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:35:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:35:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:35:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:35:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:35:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:35:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:35:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:35:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:35:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:35:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:35:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:35:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:35:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:35:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:35:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:35:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:35:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:35:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:35:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:35:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:35:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:35:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:09,779 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:35:09,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:35:09,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738736157] [2022-07-21 15:35:09,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738736157] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:35:09,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:35:09,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:35:09,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813202263] [2022-07-21 15:35:09,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:35:09,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:35:09,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:35:09,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:35:09,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:35:09,782 INFO L87 Difference]: Start difference. First operand 3084 states and 4182 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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) [2022-07-21 15:35:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:35:12,958 INFO L93 Difference]: Finished difference Result 3084 states and 4182 transitions. [2022-07-21 15:35:12,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:35:12,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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 144 [2022-07-21 15:35:12,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:35:12,970 INFO L225 Difference]: With dead ends: 3084 [2022-07-21 15:35:12,970 INFO L226 Difference]: Without dead ends: 3082 [2022-07-21 15:35:12,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:35:12,972 INFO L413 NwaCegarLoop]: 2146 mSDtfsCounter, 3645 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2538 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3807 SdHoareTripleChecker+Valid, 3660 SdHoareTripleChecker+Invalid, 4844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:35:12,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3807 Valid, 3660 Invalid, 4844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2538 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-21 15:35:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2022-07-21 15:35:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 3082. [2022-07-21 15:35:13,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3082 states, 2035 states have (on average 1.2186732186732188) internal successors, (2480), 2104 states have internal predecessors, (2480), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-21 15:35:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 4180 transitions. [2022-07-21 15:35:13,157 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 4180 transitions. Word has length 144 [2022-07-21 15:35:13,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:35:13,157 INFO L495 AbstractCegarLoop]: Abstraction has 3082 states and 4180 transitions. [2022-07-21 15:35:13,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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) [2022-07-21 15:35:13,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 4180 transitions. [2022-07-21 15:35:13,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-21 15:35:13,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:35:13,160 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:35:13,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 15:35:13,160 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:35:13,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:35:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash -916427719, now seen corresponding path program 1 times [2022-07-21 15:35:13,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:35:13,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400789038] [2022-07-21 15:35:13,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:35:13,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:35:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:35:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:35:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:35:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:35:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:35:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:35:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:35:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:35:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:35:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:35:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:35:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:35:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:35:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:35:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:35:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 15:35:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:35:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:35:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 15:35:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 15:35:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:35:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 15:35:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-07-21 15:35:13,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:35:13,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400789038] [2022-07-21 15:35:13,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400789038] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:35:13,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:35:13,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 15:35:13,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112497286] [2022-07-21 15:35:13,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:35:13,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 15:35:13,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:35:13,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 15:35:13,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:35:13,538 INFO L87 Difference]: Start difference. First operand 3082 states and 4180 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 15:35:18,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:35:18,605 INFO L93 Difference]: Finished difference Result 3451 states and 4628 transitions. [2022-07-21 15:35:18,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 15:35:18,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 173 [2022-07-21 15:35:18,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:35:18,617 INFO L225 Difference]: With dead ends: 3451 [2022-07-21 15:35:18,617 INFO L226 Difference]: Without dead ends: 3449 [2022-07-21 15:35:18,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-21 15:35:18,619 INFO L413 NwaCegarLoop]: 2169 mSDtfsCounter, 4095 mSDsluCounter, 2648 mSDsCounter, 0 mSdLazyCounter, 6566 mSolverCounterSat, 2964 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4221 SdHoareTripleChecker+Valid, 4817 SdHoareTripleChecker+Invalid, 9530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2964 IncrementalHoareTripleChecker+Valid, 6566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:35:18,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4221 Valid, 4817 Invalid, 9530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2964 Valid, 6566 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-21 15:35:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2022-07-21 15:35:18,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3305. [2022-07-21 15:35:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 2181 states have (on average 1.2104539202200826) internal successors, (2640), 2254 states have internal predecessors, (2640), 889 states have call successors, (889), 226 states have call predecessors, (889), 225 states have return successors, (887), 871 states have call predecessors, (887), 887 states have call successors, (887) [2022-07-21 15:35:18,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4416 transitions. [2022-07-21 15:35:18,825 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4416 transitions. Word has length 173 [2022-07-21 15:35:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:35:18,826 INFO L495 AbstractCegarLoop]: Abstraction has 3305 states and 4416 transitions. [2022-07-21 15:35:18,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 15:35:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4416 transitions. [2022-07-21 15:35:18,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-21 15:35:18,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:35:18,829 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:35:18,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 15:35:18,829 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:35:18,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:35:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1772980981, now seen corresponding path program 1 times [2022-07-21 15:35:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:35:18,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063821946] [2022-07-21 15:35:18,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:35:18,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:35:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:18,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:35:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:35:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:18,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:35:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:18,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:35:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:18,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:35:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:18,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:35:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:18,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:35:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:18,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:35:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:18,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:35:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:18,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:35:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:18,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:35:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:19,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:35:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:19,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:35:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:19,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:35:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:19,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:35:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:19,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:35:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:19,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:35:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:19,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:35:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:19,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:35:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:19,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:35:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:19,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:35:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:19,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:35:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:19,072 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:35:19,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:35:19,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063821946] [2022-07-21 15:35:19,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063821946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:35:19,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:35:19,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:35:19,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127643013] [2022-07-21 15:35:19,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:35:19,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:35:19,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:35:19,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:35:19,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:35:19,075 INFO L87 Difference]: Start difference. First operand 3305 states and 4416 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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) [2022-07-21 15:35:22,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:35:22,149 INFO L93 Difference]: Finished difference Result 3305 states and 4416 transitions. [2022-07-21 15:35:22,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:35:22,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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 150 [2022-07-21 15:35:22,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:35:22,161 INFO L225 Difference]: With dead ends: 3305 [2022-07-21 15:35:22,162 INFO L226 Difference]: Without dead ends: 3303 [2022-07-21 15:35:22,163 INFO L412 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 [2022-07-21 15:35:22,164 INFO L413 NwaCegarLoop]: 2142 mSDtfsCounter, 3633 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3794 SdHoareTripleChecker+Valid, 3656 SdHoareTripleChecker+Invalid, 4840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:35:22,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3794 Valid, 3656 Invalid, 4840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-21 15:35:22,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2022-07-21 15:35:22,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 3303. [2022-07-21 15:35:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3303 states, 2180 states have (on average 1.2100917431192661) internal successors, (2638), 2252 states have internal predecessors, (2638), 889 states have call successors, (889), 226 states have call predecessors, (889), 225 states have return successors, (887), 871 states have call predecessors, (887), 887 states have call successors, (887) [2022-07-21 15:35:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 4414 transitions. [2022-07-21 15:35:22,371 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 4414 transitions. Word has length 150 [2022-07-21 15:35:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:35:22,372 INFO L495 AbstractCegarLoop]: Abstraction has 3303 states and 4414 transitions. [2022-07-21 15:35:22,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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) [2022-07-21 15:35:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 4414 transitions. [2022-07-21 15:35:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-21 15:35:22,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:35:22,374 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:35:22,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 15:35:22,375 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:35:22,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:35:22,375 INFO L85 PathProgramCache]: Analyzing trace with hash 634820414, now seen corresponding path program 1 times [2022-07-21 15:35:22,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:35:22,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435735801] [2022-07-21 15:35:22,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:35:22,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:35:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:35:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:35:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:35:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:35:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:35:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:35:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:35:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:35:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:35:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:35:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:35:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:35:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:35:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:35:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:35:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:35:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:35:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:35:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:35:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:35:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:35:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:35:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 15:35:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:35:22,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:35:22,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435735801] [2022-07-21 15:35:22,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435735801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:35:22,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:35:22,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:35:22,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087273479] [2022-07-21 15:35:22,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:35:22,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:35:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:35:22,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:35:22,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:35:22,638 INFO L87 Difference]: Start difference. First operand 3303 states and 4414 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 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) [2022-07-21 15:35:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:35:25,665 INFO L93 Difference]: Finished difference Result 3303 states and 4414 transitions. [2022-07-21 15:35:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:35:25,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 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 156 [2022-07-21 15:35:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:35:25,677 INFO L225 Difference]: With dead ends: 3303 [2022-07-21 15:35:25,677 INFO L226 Difference]: Without dead ends: 3301 [2022-07-21 15:35:25,679 INFO L412 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 [2022-07-21 15:35:25,680 INFO L413 NwaCegarLoop]: 2140 mSDtfsCounter, 3627 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2532 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3787 SdHoareTripleChecker+Valid, 3654 SdHoareTripleChecker+Invalid, 4838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:35:25,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3787 Valid, 3654 Invalid, 4838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2532 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-21 15:35:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3301 states. [2022-07-21 15:35:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 3301. [2022-07-21 15:35:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3301 states, 2179 states have (on average 1.2097292335933916) internal successors, (2636), 2250 states have internal predecessors, (2636), 889 states have call successors, (889), 226 states have call predecessors, (889), 225 states have return successors, (887), 871 states have call predecessors, (887), 887 states have call successors, (887) [2022-07-21 15:35:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 4412 transitions. [2022-07-21 15:35:25,963 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 4412 transitions. Word has length 156 [2022-07-21 15:35:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:35:25,963 INFO L495 AbstractCegarLoop]: Abstraction has 3301 states and 4412 transitions. [2022-07-21 15:35:25,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 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) [2022-07-21 15:35:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 4412 transitions. [2022-07-21 15:35:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-21 15:35:25,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:35:25,966 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:35:25,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 15:35:25,967 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:35:25,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:35:25,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1970890977, now seen corresponding path program 1 times [2022-07-21 15:35:25,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:35:25,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678275361] [2022-07-21 15:35:25,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:35:25,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:35:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:35:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:35:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:35:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:35:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:35:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:35:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:35:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:35:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:35:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:35:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:35:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:35:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:35:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:35:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:35:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:35:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:35:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:35:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:35:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:35:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:35:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:35:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 15:35:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 15:35:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:35:26,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:35:26,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678275361] [2022-07-21 15:35:26,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678275361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:35:26,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:35:26,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:35:26,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611119669] [2022-07-21 15:35:26,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:35:26,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:35:26,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:35:26,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:35:26,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:35:26,218 INFO L87 Difference]: Start difference. First operand 3301 states and 4412 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 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) [2022-07-21 15:35:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:35:29,269 INFO L93 Difference]: Finished difference Result 3301 states and 4412 transitions. [2022-07-21 15:35:29,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:35:29,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 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 162 [2022-07-21 15:35:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:35:29,278 INFO L225 Difference]: With dead ends: 3301 [2022-07-21 15:35:29,278 INFO L226 Difference]: Without dead ends: 3299 [2022-07-21 15:35:29,279 INFO L412 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 [2022-07-21 15:35:29,279 INFO L413 NwaCegarLoop]: 2138 mSDtfsCounter, 3621 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2530 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3780 SdHoareTripleChecker+Valid, 3652 SdHoareTripleChecker+Invalid, 4836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:35:29,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3780 Valid, 3652 Invalid, 4836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2530 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-21 15:35:29,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2022-07-21 15:35:29,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 3299. [2022-07-21 15:35:29,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3299 states, 2178 states have (on average 1.209366391184573) internal successors, (2634), 2248 states have internal predecessors, (2634), 889 states have call successors, (889), 226 states have call predecessors, (889), 225 states have return successors, (887), 871 states have call predecessors, (887), 887 states have call successors, (887) [2022-07-21 15:35:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3299 states to 3299 states and 4410 transitions. [2022-07-21 15:35:29,456 INFO L78 Accepts]: Start accepts. Automaton has 3299 states and 4410 transitions. Word has length 162 [2022-07-21 15:35:29,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:35:29,456 INFO L495 AbstractCegarLoop]: Abstraction has 3299 states and 4410 transitions. [2022-07-21 15:35:29,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 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) [2022-07-21 15:35:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3299 states and 4410 transitions. [2022-07-21 15:35:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-21 15:35:29,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:35:29,460 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:35:29,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 15:35:29,460 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:35:29,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:35:29,460 INFO L85 PathProgramCache]: Analyzing trace with hash -356517854, now seen corresponding path program 1 times [2022-07-21 15:35:29,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:35:29,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949880644] [2022-07-21 15:35:29,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:35:29,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:35:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:35:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:35:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:35:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:35:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:35:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:35:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:35:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:35:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:35:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:35:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:35:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:35:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:35:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:35:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:35:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:35:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:35:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:35:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:35:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:35:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:35:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:35:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 15:35:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 15:35:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 15:35:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:35:29,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:35:29,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949880644] [2022-07-21 15:35:29,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949880644] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:35:29,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:35:29,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:35:29,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548134948] [2022-07-21 15:35:29,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:35:29,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:35:29,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:35:29,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:35:29,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:35:29,691 INFO L87 Difference]: Start difference. First operand 3299 states and 4410 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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) [2022-07-21 15:35:32,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:35:32,910 INFO L93 Difference]: Finished difference Result 3299 states and 4410 transitions. [2022-07-21 15:35:32,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:35:32,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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 168 [2022-07-21 15:35:32,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:35:32,919 INFO L225 Difference]: With dead ends: 3299 [2022-07-21 15:35:32,919 INFO L226 Difference]: Without dead ends: 3297 [2022-07-21 15:35:32,920 INFO L412 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 [2022-07-21 15:35:32,921 INFO L413 NwaCegarLoop]: 2136 mSDtfsCounter, 3615 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3773 SdHoareTripleChecker+Valid, 3650 SdHoareTripleChecker+Invalid, 4834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:35:32,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3773 Valid, 3650 Invalid, 4834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2528 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-21 15:35:32,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2022-07-21 15:35:33,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 3297. [2022-07-21 15:35:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3297 states, 2177 states have (on average 1.2090032154340835) internal successors, (2632), 2246 states have internal predecessors, (2632), 889 states have call successors, (889), 226 states have call predecessors, (889), 225 states have return successors, (887), 871 states have call predecessors, (887), 887 states have call successors, (887) [2022-07-21 15:35:33,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3297 states to 3297 states and 4408 transitions. [2022-07-21 15:35:33,146 INFO L78 Accepts]: Start accepts. Automaton has 3297 states and 4408 transitions. Word has length 168 [2022-07-21 15:35:33,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:35:33,146 INFO L495 AbstractCegarLoop]: Abstraction has 3297 states and 4408 transitions. [2022-07-21 15:35:33,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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) [2022-07-21 15:35:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3297 states and 4408 transitions. [2022-07-21 15:35:33,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-21 15:35:33,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:35:33,150 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:35:33,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 15:35:33,150 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:35:33,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:35:33,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2019610945, now seen corresponding path program 1 times [2022-07-21 15:35:33,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:35:33,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510620970] [2022-07-21 15:35:33,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:35:33,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:35:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:35:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:35:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:35:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:35:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:35:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:35:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:35:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:35:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:35:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:35:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:35:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:35:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:35:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:35:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:35:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:35:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:35:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:35:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:35:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:35:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:35:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:35:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 15:35:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 15:35:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 15:35:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 15:35:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:33,460 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:35:33,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:35:33,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510620970] [2022-07-21 15:35:33,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510620970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:35:33,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:35:33,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:35:33,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788273274] [2022-07-21 15:35:33,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:35:33,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:35:33,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:35:33,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:35:33,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:35:33,463 INFO L87 Difference]: Start difference. First operand 3297 states and 4408 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2022-07-21 15:35:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:35:36,692 INFO L93 Difference]: Finished difference Result 3297 states and 4408 transitions. [2022-07-21 15:35:36,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:35:36,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 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 174 [2022-07-21 15:35:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:35:36,701 INFO L225 Difference]: With dead ends: 3297 [2022-07-21 15:35:36,701 INFO L226 Difference]: Without dead ends: 3295 [2022-07-21 15:35:36,702 INFO L412 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 [2022-07-21 15:35:36,703 INFO L413 NwaCegarLoop]: 2134 mSDtfsCounter, 3609 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2526 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3766 SdHoareTripleChecker+Valid, 3648 SdHoareTripleChecker+Invalid, 4832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:35:36,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3766 Valid, 3648 Invalid, 4832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2526 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-21 15:35:36,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2022-07-21 15:35:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3295. [2022-07-21 15:35:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3295 states, 2176 states have (on average 1.208639705882353) internal successors, (2630), 2244 states have internal predecessors, (2630), 889 states have call successors, (889), 226 states have call predecessors, (889), 225 states have return successors, (887), 871 states have call predecessors, (887), 887 states have call successors, (887) [2022-07-21 15:35:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3295 states to 3295 states and 4406 transitions. [2022-07-21 15:35:36,896 INFO L78 Accepts]: Start accepts. Automaton has 3295 states and 4406 transitions. Word has length 174 [2022-07-21 15:35:36,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:35:36,897 INFO L495 AbstractCegarLoop]: Abstraction has 3295 states and 4406 transitions. [2022-07-21 15:35:36,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2022-07-21 15:35:36,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3295 states and 4406 transitions. [2022-07-21 15:35:36,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-21 15:35:36,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:35:36,900 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:35:36,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-21 15:35:36,901 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:35:36,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:35:36,901 INFO L85 PathProgramCache]: Analyzing trace with hash -398535084, now seen corresponding path program 1 times [2022-07-21 15:35:36,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:35:36,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318560847] [2022-07-21 15:35:36,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:35:36,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:35:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:36,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:35:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:35:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:35:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:35:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:35:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:35:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:35:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:35:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:35:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:35:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:35:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:35:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:35:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:35:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:35:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:35:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:35:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:35:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:35:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:35:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:35:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:35:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 15:35:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 15:35:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 15:35:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 15:35:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-21 15:35:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:35:37,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:35:37,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318560847] [2022-07-21 15:35:37,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318560847] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:35:37,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:35:37,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:35:37,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756638637] [2022-07-21 15:35:37,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:35:37,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:35:37,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:35:37,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:35:37,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:35:37,136 INFO L87 Difference]: Start difference. First operand 3295 states and 4406 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 15:35:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:35:40,318 INFO L93 Difference]: Finished difference Result 3295 states and 4406 transitions. [2022-07-21 15:35:40,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:35:40,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2022-07-21 15:35:40,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:35:40,326 INFO L225 Difference]: With dead ends: 3295 [2022-07-21 15:35:40,326 INFO L226 Difference]: Without dead ends: 3123 [2022-07-21 15:35:40,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:35:40,328 INFO L413 NwaCegarLoop]: 2133 mSDtfsCounter, 3600 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2526 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 3647 SdHoareTripleChecker+Invalid, 4832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:35:40,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 3647 Invalid, 4832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2526 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-21 15:35:40,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3123 states. [2022-07-21 15:35:40,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3123 to 3123. [2022-07-21 15:35:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3123 states, 2073 states have (on average 1.2175590931017848) internal successors, (2524), 2139 states have internal predecessors, (2524), 840 states have call successors, (840), 206 states have call predecessors, (840), 206 states have return successors, (840), 824 states have call predecessors, (840), 840 states have call successors, (840) [2022-07-21 15:35:40,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 4204 transitions. [2022-07-21 15:35:40,560 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 4204 transitions. Word has length 180 [2022-07-21 15:35:40,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:35:40,560 INFO L495 AbstractCegarLoop]: Abstraction has 3123 states and 4204 transitions. [2022-07-21 15:35:40,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 15:35:40,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 4204 transitions. [2022-07-21 15:35:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-07-21 15:35:40,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:35:40,564 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:35:40,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-21 15:35:40,565 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:35:40,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:35:40,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2021555018, now seen corresponding path program 1 times [2022-07-21 15:35:40,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:35:40,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126420926] [2022-07-21 15:35:40,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:35:40,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:35:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:35:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:35:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:35:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:35:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:35:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:35:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:35:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:35:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:35:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:35:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:35:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:35:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:35:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:35:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:35:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 15:35:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:35:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:35:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 15:35:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 15:35:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:35:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 15:35:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 15:35:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 15:35:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 15:35:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 15:35:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 15:35:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-21 15:35:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:35:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:35:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:35:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2022-07-21 15:35:40,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:35:40,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126420926] [2022-07-21 15:35:40,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126420926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:35:40,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:35:40,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:35:40,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121196263] [2022-07-21 15:35:40,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:35:40,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:35:40,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:35:40,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:35:40,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:35:40,923 INFO L87 Difference]: Start difference. First operand 3123 states and 4204 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (35), 7 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) [2022-07-21 15:35:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:35:46,462 INFO L93 Difference]: Finished difference Result 3353 states and 4537 transitions. [2022-07-21 15:35:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 15:35:46,462 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (35), 7 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) Word has length 226 [2022-07-21 15:35:46,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:35:46,472 INFO L225 Difference]: With dead ends: 3353 [2022-07-21 15:35:46,472 INFO L226 Difference]: Without dead ends: 3351 [2022-07-21 15:35:46,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2022-07-21 15:35:46,475 INFO L413 NwaCegarLoop]: 2045 mSDtfsCounter, 4153 mSDsluCounter, 3246 mSDsCounter, 0 mSdLazyCounter, 6622 mSolverCounterSat, 3770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4167 SdHoareTripleChecker+Valid, 5291 SdHoareTripleChecker+Invalid, 10392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3770 IncrementalHoareTripleChecker+Valid, 6622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:35:46,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4167 Valid, 5291 Invalid, 10392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3770 Valid, 6622 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-21 15:35:46,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3351 states. [2022-07-21 15:35:46,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3351 to 3121. [2022-07-21 15:35:46,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 2072 states have (on average 1.2166988416988418) internal successors, (2521), 2137 states have internal predecessors, (2521), 840 states have call successors, (840), 206 states have call predecessors, (840), 206 states have return successors, (840), 824 states have call predecessors, (840), 840 states have call successors, (840) [2022-07-21 15:35:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 4201 transitions. [2022-07-21 15:35:46,740 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 4201 transitions. Word has length 226 [2022-07-21 15:35:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:35:46,741 INFO L495 AbstractCegarLoop]: Abstraction has 3121 states and 4201 transitions. [2022-07-21 15:35:46,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (35), 7 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) [2022-07-21 15:35:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 4201 transitions. [2022-07-21 15:35:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-21 15:35:46,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:35:46,745 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:35:46,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-21 15:35:46,746 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:35:46,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:35:46,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1958435665, now seen corresponding path program 1 times [2022-07-21 15:35:46,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:35:46,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094852497] [2022-07-21 15:35:46,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:35:46,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:35:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:35:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:35:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:35:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:35:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:35:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:35:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:35:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:35:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:35:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:35:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:35:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:35:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:35:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:35:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:35:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:35:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:35:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:35:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 15:35:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:46,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 15:35:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:47,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-21 15:35:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:47,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:47,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 15:35:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:47,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 15:35:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:47,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-21 15:35:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:47,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-21 15:35:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-07-21 15:35:47,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:35:47,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094852497] [2022-07-21 15:35:47,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094852497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:35:47,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:35:47,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 15:35:47,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577649329] [2022-07-21 15:35:47,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:35:47,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 15:35:47,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:35:47,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 15:35:47,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 15:35:47,033 INFO L87 Difference]: Start difference. First operand 3121 states and 4201 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:35:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:35:51,783 INFO L93 Difference]: Finished difference Result 6551 states and 8854 transitions. [2022-07-21 15:35:51,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 15:35:51,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 220 [2022-07-21 15:35:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:35:51,795 INFO L225 Difference]: With dead ends: 6551 [2022-07-21 15:35:51,795 INFO L226 Difference]: Without dead ends: 3449 [2022-07-21 15:35:51,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-21 15:35:51,806 INFO L413 NwaCegarLoop]: 1833 mSDtfsCounter, 3250 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 4137 mSolverCounterSat, 3246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3250 SdHoareTripleChecker+Valid, 3936 SdHoareTripleChecker+Invalid, 7383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3246 IncrementalHoareTripleChecker+Valid, 4137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:35:51,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3250 Valid, 3936 Invalid, 7383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3246 Valid, 4137 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-21 15:35:51,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2022-07-21 15:35:52,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3122. [2022-07-21 15:35:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 2073 states have (on average 1.216594307766522) internal successors, (2522), 2138 states have internal predecessors, (2522), 840 states have call successors, (840), 206 states have call predecessors, (840), 206 states have return successors, (840), 824 states have call predecessors, (840), 840 states have call successors, (840) [2022-07-21 15:35:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 4202 transitions. [2022-07-21 15:35:52,058 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 4202 transitions. Word has length 220 [2022-07-21 15:35:52,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:35:52,059 INFO L495 AbstractCegarLoop]: Abstraction has 3122 states and 4202 transitions. [2022-07-21 15:35:52,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:35:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 4202 transitions. [2022-07-21 15:35:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-07-21 15:35:52,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:35:52,063 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:35:52,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-21 15:35:52,063 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:35:52,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:35:52,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2115564295, now seen corresponding path program 1 times [2022-07-21 15:35:52,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:35:52,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747002544] [2022-07-21 15:35:52,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:35:52,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:35:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:35:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:35:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:35:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:35:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:35:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:35:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:35:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:35:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:35:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:35:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:35:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:35:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:35:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:35:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:35:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:35:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:35:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:35:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 15:35:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 15:35:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-21 15:35:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-21 15:35:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-21 15:35:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-21 15:35:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-21 15:35:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-07-21 15:35:52,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:35:52,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747002544] [2022-07-21 15:35:52,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747002544] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:35:52,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217764561] [2022-07-21 15:35:52,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:35:52,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:35:52,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:35:52,407 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) [2022-07-21 15:35:52,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 15:35:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:53,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 2622 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 15:35:53,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:35:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2022-07-21 15:35:53,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:35:53,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217764561] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:35:53,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:35:53,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-21 15:35:53,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525651900] [2022-07-21 15:35:53,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:35:53,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 15:35:53,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:35:53,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 15:35:53,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:35:53,194 INFO L87 Difference]: Start difference. First operand 3122 states and 4202 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:35:53,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:35:53,470 INFO L93 Difference]: Finished difference Result 6953 states and 9438 transitions. [2022-07-21 15:35:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 15:35:53,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 223 [2022-07-21 15:35:53,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:35:53,482 INFO L225 Difference]: With dead ends: 6953 [2022-07-21 15:35:53,482 INFO L226 Difference]: Without dead ends: 3850 [2022-07-21 15:35:53,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:35:53,491 INFO L413 NwaCegarLoop]: 2903 mSDtfsCounter, 403 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 5276 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:35:53,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 5276 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 15:35:53,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2022-07-21 15:35:53,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3123. [2022-07-21 15:35:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3123 states, 2074 states have (on average 1.2164898746383799) internal successors, (2523), 2139 states have internal predecessors, (2523), 840 states have call successors, (840), 206 states have call predecessors, (840), 206 states have return successors, (840), 824 states have call predecessors, (840), 840 states have call successors, (840) [2022-07-21 15:35:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 4203 transitions. [2022-07-21 15:35:53,754 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 4203 transitions. Word has length 223 [2022-07-21 15:35:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:35:53,755 INFO L495 AbstractCegarLoop]: Abstraction has 3123 states and 4203 transitions. [2022-07-21 15:35:53,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:35:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 4203 transitions. [2022-07-21 15:35:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-07-21 15:35:53,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:35:53,759 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:35:53,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 15:35:53,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-21 15:35:53,975 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:35:53,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:35:53,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1887379189, now seen corresponding path program 1 times [2022-07-21 15:35:53,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:35:53,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428971690] [2022-07-21 15:35:53,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:35:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:35:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:35:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:35:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:35:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:35:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:35:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:35:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:35:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:35:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:35:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:35:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:35:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:35:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:35:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:35:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:35:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 15:35:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:35:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:35:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 15:35:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 15:35:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:35:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 15:35:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 15:35:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 15:35:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 15:35:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 15:35:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-21 15:35:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-21 15:35:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-21 15:35:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-21 15:35:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:35:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-21 15:35:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:35:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2022-07-21 15:35:54,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:35:54,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428971690] [2022-07-21 15:35:54,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428971690] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:35:54,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:35:54,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 15:35:54,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719379627] [2022-07-21 15:35:54,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:35:54,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 15:35:54,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:35:54,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 15:35:54,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:35:54,259 INFO L87 Difference]: Start difference. First operand 3123 states and 4203 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (37), 7 states have call predecessors, (37), 2 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) [2022-07-21 15:35:59,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:35:59,827 INFO L93 Difference]: Finished difference Result 6684 states and 9069 transitions. [2022-07-21 15:35:59,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 15:35:59,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (37), 7 states have call predecessors, (37), 2 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) Word has length 243 [2022-07-21 15:35:59,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:35:59,853 INFO L225 Difference]: With dead ends: 6684 [2022-07-21 15:35:59,854 INFO L226 Difference]: Without dead ends: 3580 [2022-07-21 15:35:59,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2022-07-21 15:35:59,867 INFO L413 NwaCegarLoop]: 1835 mSDtfsCounter, 4072 mSDsluCounter, 2538 mSDsCounter, 0 mSdLazyCounter, 4802 mSolverCounterSat, 4153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4072 SdHoareTripleChecker+Valid, 4373 SdHoareTripleChecker+Invalid, 8955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4153 IncrementalHoareTripleChecker+Valid, 4802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:35:59,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4072 Valid, 4373 Invalid, 8955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4153 Valid, 4802 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-21 15:35:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2022-07-21 15:36:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 3127. [2022-07-21 15:36:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3127 states, 2078 states have (on average 1.216073147256978) internal successors, (2527), 2143 states have internal predecessors, (2527), 840 states have call successors, (840), 206 states have call predecessors, (840), 206 states have return successors, (840), 824 states have call predecessors, (840), 840 states have call successors, (840) [2022-07-21 15:36:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 4207 transitions. [2022-07-21 15:36:00,141 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 4207 transitions. Word has length 243 [2022-07-21 15:36:00,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:36:00,142 INFO L495 AbstractCegarLoop]: Abstraction has 3127 states and 4207 transitions. [2022-07-21 15:36:00,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (37), 7 states have call predecessors, (37), 2 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) [2022-07-21 15:36:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 4207 transitions. [2022-07-21 15:36:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-07-21 15:36:00,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:36:00,147 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:36:00,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-21 15:36:00,147 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:36:00,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:36:00,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2145367829, now seen corresponding path program 1 times [2022-07-21 15:36:00,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:36:00,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37742908] [2022-07-21 15:36:00,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:36:00,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:36:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:36:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:36:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:36:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:36:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:36:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:36:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:36:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:36:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:36:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 15:36:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:36:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:36:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 15:36:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 15:36:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:36:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 15:36:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 15:36:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 15:36:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 15:36:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 15:36:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-21 15:36:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-21 15:36:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-21 15:36:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-21 15:36:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-21 15:36:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2022-07-21 15:36:00,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:36:00,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37742908] [2022-07-21 15:36:00,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37742908] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:36:00,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895907558] [2022-07-21 15:36:00,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:36:00,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:36:00,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:36:00,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:36:00,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 15:36:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:01,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 2460 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 15:36:01,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:36:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2022-07-21 15:36:01,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:36:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2022-07-21 15:36:01,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895907558] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 15:36:01,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 15:36:01,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 11 [2022-07-21 15:36:01,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418968633] [2022-07-21 15:36:01,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 15:36:01,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 15:36:01,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:36:01,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 15:36:01,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:36:01,406 INFO L87 Difference]: Start difference. First operand 3127 states and 4207 transitions. Second operand has 11 states, 11 states have (on average 11.818181818181818) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (52), 7 states have call predecessors, (52), 2 states have return successors, (36), 2 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-21 15:36:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:36:07,291 INFO L93 Difference]: Finished difference Result 6824 states and 9275 transitions. [2022-07-21 15:36:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 15:36:07,292 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.818181818181818) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (52), 7 states have call predecessors, (52), 2 states have return successors, (36), 2 states have call predecessors, (36), 3 states have call successors, (36) Word has length 251 [2022-07-21 15:36:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:36:07,306 INFO L225 Difference]: With dead ends: 6824 [2022-07-21 15:36:07,307 INFO L226 Difference]: Without dead ends: 3716 [2022-07-21 15:36:07,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 576 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=252, Invalid=560, Unknown=0, NotChecked=0, Total=812 [2022-07-21 15:36:07,318 INFO L413 NwaCegarLoop]: 1839 mSDtfsCounter, 4263 mSDsluCounter, 2538 mSDsCounter, 0 mSdLazyCounter, 4924 mSolverCounterSat, 4381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4263 SdHoareTripleChecker+Valid, 4377 SdHoareTripleChecker+Invalid, 9305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4381 IncrementalHoareTripleChecker+Valid, 4924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:36:07,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4263 Valid, 4377 Invalid, 9305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4381 Valid, 4924 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-21 15:36:07,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3716 states. [2022-07-21 15:36:07,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3716 to 3223. [2022-07-21 15:36:07,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 2150 states have (on average 1.2144186046511627) internal successors, (2611), 2215 states have internal predecessors, (2611), 864 states have call successors, (864), 206 states have call predecessors, (864), 206 states have return successors, (864), 848 states have call predecessors, (864), 864 states have call successors, (864) [2022-07-21 15:36:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4339 transitions. [2022-07-21 15:36:07,597 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4339 transitions. Word has length 251 [2022-07-21 15:36:07,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:36:07,597 INFO L495 AbstractCegarLoop]: Abstraction has 3223 states and 4339 transitions. [2022-07-21 15:36:07,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.818181818181818) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (52), 7 states have call predecessors, (52), 2 states have return successors, (36), 2 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-21 15:36:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4339 transitions. [2022-07-21 15:36:07,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-21 15:36:07,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:36:07,603 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:36:07,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 15:36:07,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-21 15:36:07,832 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:36:07,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:36:07,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1941528660, now seen corresponding path program 1 times [2022-07-21 15:36:07,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:36:07,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52570885] [2022-07-21 15:36:07,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:36:07,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:36:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:07,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:36:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:07,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:36:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:07,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:36:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:36:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:36:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:36:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:36:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:36:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:36:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:36:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:36:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:36:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 15:36:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 15:36:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 15:36:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:36:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:36:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-21 15:36:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-21 15:36:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-21 15:36:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-21 15:36:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-07-21 15:36:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-07-21 15:36:08,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:36:08,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52570885] [2022-07-21 15:36:08,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52570885] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:36:08,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155470032] [2022-07-21 15:36:08,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:36:08,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:36:08,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:36:08,245 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:36:08,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 15:36:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:09,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 2747 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 15:36:09,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:36:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 68 proven. 1 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-07-21 15:36:09,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:36:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-07-21 15:36:09,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155470032] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 15:36:09,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 15:36:09,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2022-07-21 15:36:09,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027456344] [2022-07-21 15:36:09,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 15:36:09,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 15:36:09,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:36:09,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 15:36:09,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:36:09,177 INFO L87 Difference]: Start difference. First operand 3223 states and 4339 transitions. Second operand has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 7 states have internal predecessors, (161), 2 states have call successors, (50), 6 states have call predecessors, (50), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-21 15:36:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:36:15,243 INFO L93 Difference]: Finished difference Result 6847 states and 9254 transitions. [2022-07-21 15:36:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 15:36:15,244 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 7 states have internal predecessors, (161), 2 states have call successors, (50), 6 states have call predecessors, (50), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 253 [2022-07-21 15:36:15,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:36:15,255 INFO L225 Difference]: With dead ends: 6847 [2022-07-21 15:36:15,256 INFO L226 Difference]: Without dead ends: 3643 [2022-07-21 15:36:15,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-07-21 15:36:15,265 INFO L413 NwaCegarLoop]: 1832 mSDtfsCounter, 3256 mSDsluCounter, 3203 mSDsCounter, 0 mSdLazyCounter, 7637 mSolverCounterSat, 3250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3256 SdHoareTripleChecker+Valid, 5035 SdHoareTripleChecker+Invalid, 10887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3250 IncrementalHoareTripleChecker+Valid, 7637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:36:15,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3256 Valid, 5035 Invalid, 10887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3250 Valid, 7637 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-21 15:36:15,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2022-07-21 15:36:15,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3232. [2022-07-21 15:36:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3232 states, 2159 states have (on average 1.2135247799907365) internal successors, (2620), 2224 states have internal predecessors, (2620), 864 states have call successors, (864), 206 states have call predecessors, (864), 206 states have return successors, (864), 848 states have call predecessors, (864), 864 states have call successors, (864) [2022-07-21 15:36:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 3232 states and 4348 transitions. [2022-07-21 15:36:15,527 INFO L78 Accepts]: Start accepts. Automaton has 3232 states and 4348 transitions. Word has length 253 [2022-07-21 15:36:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:36:15,528 INFO L495 AbstractCegarLoop]: Abstraction has 3232 states and 4348 transitions. [2022-07-21 15:36:15,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 7 states have internal predecessors, (161), 2 states have call successors, (50), 6 states have call predecessors, (50), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-21 15:36:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3232 states and 4348 transitions. [2022-07-21 15:36:15,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-07-21 15:36:15,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:36:15,534 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:36:15,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 15:36:15,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:36:15,760 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:36:15,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:36:15,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1240481108, now seen corresponding path program 2 times [2022-07-21 15:36:15,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:36:15,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857993740] [2022-07-21 15:36:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:36:15,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:36:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:15,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:36:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:15,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:36:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:15,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:36:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:15,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:36:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:15,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:15,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:15,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:15,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:36:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:15,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:15,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:15,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:15,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:36:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:15,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:15,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:15,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:36:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:36:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:36:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:36:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:36:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:36:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 15:36:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 15:36:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-21 15:36:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:36:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:36:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-21 15:36:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-21 15:36:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-21 15:36:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-21 15:36:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-21 15:36:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2022-07-21 15:36:16,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:36:16,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857993740] [2022-07-21 15:36:16,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857993740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:36:16,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:36:16,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:36:16,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805485109] [2022-07-21 15:36:16,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:36:16,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:36:16,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:36:16,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:36:16,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:36:16,127 INFO L87 Difference]: Start difference. First operand 3232 states and 4348 transitions. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-21 15:36:23,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:36:23,287 INFO L93 Difference]: Finished difference Result 7598 states and 10362 transitions. [2022-07-21 15:36:23,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 15:36:23,287 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) Word has length 262 [2022-07-21 15:36:23,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:36:23,303 INFO L225 Difference]: With dead ends: 7598 [2022-07-21 15:36:23,303 INFO L226 Difference]: Without dead ends: 4385 [2022-07-21 15:36:23,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-07-21 15:36:23,312 INFO L413 NwaCegarLoop]: 2487 mSDtfsCounter, 3654 mSDsluCounter, 5883 mSDsCounter, 0 mSdLazyCounter, 8504 mSolverCounterSat, 3248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3801 SdHoareTripleChecker+Valid, 8370 SdHoareTripleChecker+Invalid, 11752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3248 IncrementalHoareTripleChecker+Valid, 8504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:36:23,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3801 Valid, 8370 Invalid, 11752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3248 Valid, 8504 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-07-21 15:36:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4385 states. [2022-07-21 15:36:23,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4385 to 3236. [2022-07-21 15:36:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3236 states, 2162 states have (on average 1.2132284921369103) internal successors, (2623), 2227 states have internal predecessors, (2623), 864 states have call successors, (864), 206 states have call predecessors, (864), 207 states have return successors, (866), 849 states have call predecessors, (866), 864 states have call successors, (866) [2022-07-21 15:36:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 4353 transitions. [2022-07-21 15:36:23,574 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 4353 transitions. Word has length 262 [2022-07-21 15:36:23,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:36:23,575 INFO L495 AbstractCegarLoop]: Abstraction has 3236 states and 4353 transitions. [2022-07-21 15:36:23,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-21 15:36:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4353 transitions. [2022-07-21 15:36:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-21 15:36:23,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:36:23,581 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:36:23,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-21 15:36:23,581 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:36:23,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:36:23,581 INFO L85 PathProgramCache]: Analyzing trace with hash -272250472, now seen corresponding path program 1 times [2022-07-21 15:36:23,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:36:23,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283814221] [2022-07-21 15:36:23,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:36:23,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:36:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:36:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:36:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:36:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:36:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:36:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:36:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:36:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:36:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:36:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:36:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:36:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:36:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 15:36:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 15:36:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-21 15:36:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:36:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:36:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-21 15:36:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-21 15:36:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-21 15:36:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-21 15:36:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-21 15:36:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2022-07-21 15:36:23,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:36:23,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283814221] [2022-07-21 15:36:23,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283814221] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:36:23,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573318244] [2022-07-21 15:36:23,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:36:23,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:36:23,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:36:23,901 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:36:23,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 15:36:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:24,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 2845 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 15:36:24,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:36:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 68 proven. 22 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-07-21 15:36:24,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:36:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-07-21 15:36:24,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573318244] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 15:36:24,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 15:36:24,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-07-21 15:36:24,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014904780] [2022-07-21 15:36:24,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 15:36:24,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 15:36:24,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:36:24,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 15:36:24,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-21 15:36:24,942 INFO L87 Difference]: Start difference. First operand 3236 states and 4353 transitions. Second operand has 14 states, 14 states have (on average 13.142857142857142) internal successors, (184), 10 states have internal predecessors, (184), 3 states have call successors, (51), 6 states have call predecessors, (51), 2 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2022-07-21 15:36:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:36:33,690 INFO L93 Difference]: Finished difference Result 8359 states and 11486 transitions. [2022-07-21 15:36:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-21 15:36:33,691 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 13.142857142857142) internal successors, (184), 10 states have internal predecessors, (184), 3 states have call successors, (51), 6 states have call predecessors, (51), 2 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 263 [2022-07-21 15:36:33,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:36:33,705 INFO L225 Difference]: With dead ends: 8359 [2022-07-21 15:36:33,705 INFO L226 Difference]: Without dead ends: 5142 [2022-07-21 15:36:33,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2022-07-21 15:36:33,716 INFO L413 NwaCegarLoop]: 2460 mSDtfsCounter, 4496 mSDsluCounter, 6380 mSDsCounter, 0 mSdLazyCounter, 11488 mSolverCounterSat, 3568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4779 SdHoareTripleChecker+Valid, 8840 SdHoareTripleChecker+Invalid, 15056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3568 IncrementalHoareTripleChecker+Valid, 11488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:36:33,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4779 Valid, 8840 Invalid, 15056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3568 Valid, 11488 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-07-21 15:36:33,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5142 states. [2022-07-21 15:36:33,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5142 to 3252. [2022-07-21 15:36:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3252 states, 2176 states have (on average 1.2127757352941178) internal successors, (2639), 2240 states have internal predecessors, (2639), 866 states have call successors, (866), 206 states have call predecessors, (866), 207 states have return successors, (870), 852 states have call predecessors, (870), 866 states have call successors, (870) [2022-07-21 15:36:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3252 states to 3252 states and 4375 transitions. [2022-07-21 15:36:33,969 INFO L78 Accepts]: Start accepts. Automaton has 3252 states and 4375 transitions. Word has length 263 [2022-07-21 15:36:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:36:33,970 INFO L495 AbstractCegarLoop]: Abstraction has 3252 states and 4375 transitions. [2022-07-21 15:36:33,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.142857142857142) internal successors, (184), 10 states have internal predecessors, (184), 3 states have call successors, (51), 6 states have call predecessors, (51), 2 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2022-07-21 15:36:33,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3252 states and 4375 transitions. [2022-07-21 15:36:33,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2022-07-21 15:36:33,975 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:36:33,976 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:36:34,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 15:36:34,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:36:34,186 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:36:34,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:36:34,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1418467534, now seen corresponding path program 1 times [2022-07-21 15:36:34,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:36:34,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335820434] [2022-07-21 15:36:34,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:36:34,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:36:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:36:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:36:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:36:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:36:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:36:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:36:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:36:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:36:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:36:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 15:36:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:36:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:36:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 15:36:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 15:36:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:36:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 15:36:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 15:36:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 15:36:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 15:36:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-21 15:36:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-21 15:36:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-21 15:36:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-21 15:36:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-21 15:36:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-21 15:36:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-21 15:36:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-21 15:36:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 15:36:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 15:36:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-07-21 15:36:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-21 15:36:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-21 15:36:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2022-07-21 15:36:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-07-21 15:36:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2022-07-21 15:36:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2022-07-21 15:36:34,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:36:34,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335820434] [2022-07-21 15:36:34,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335820434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:36:34,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:36:34,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 15:36:34,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229995233] [2022-07-21 15:36:34,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:36:34,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 15:36:34,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:36:34,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 15:36:34,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:36:34,572 INFO L87 Difference]: Start difference. First operand 3252 states and 4375 transitions. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (48), 7 states have call predecessors, (48), 1 states have return successors, (44), 2 states have call predecessors, (44), 3 states have call successors, (44) [2022-07-21 15:36:40,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:36:40,922 INFO L93 Difference]: Finished difference Result 7685 states and 10486 transitions. [2022-07-21 15:36:40,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 15:36:40,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (48), 7 states have call predecessors, (48), 1 states have return successors, (44), 2 states have call predecessors, (44), 3 states have call successors, (44) Word has length 364 [2022-07-21 15:36:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:36:40,941 INFO L225 Difference]: With dead ends: 7685 [2022-07-21 15:36:40,942 INFO L226 Difference]: Without dead ends: 4452 [2022-07-21 15:36:40,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-07-21 15:36:40,953 INFO L413 NwaCegarLoop]: 2420 mSDtfsCounter, 4415 mSDsluCounter, 4350 mSDsCounter, 0 mSdLazyCounter, 5408 mSolverCounterSat, 4086 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4555 SdHoareTripleChecker+Valid, 6770 SdHoareTripleChecker+Invalid, 9494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4086 IncrementalHoareTripleChecker+Valid, 5408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:36:40,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4555 Valid, 6770 Invalid, 9494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4086 Valid, 5408 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-21 15:36:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4452 states. [2022-07-21 15:36:41,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4452 to 3253. [2022-07-21 15:36:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3253 states, 2177 states have (on average 1.2126779972439137) internal successors, (2640), 2241 states have internal predecessors, (2640), 866 states have call successors, (866), 206 states have call predecessors, (866), 207 states have return successors, (870), 852 states have call predecessors, (870), 866 states have call successors, (870) [2022-07-21 15:36:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3253 states to 3253 states and 4376 transitions. [2022-07-21 15:36:41,191 INFO L78 Accepts]: Start accepts. Automaton has 3253 states and 4376 transitions. Word has length 364 [2022-07-21 15:36:41,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:36:41,191 INFO L495 AbstractCegarLoop]: Abstraction has 3253 states and 4376 transitions. [2022-07-21 15:36:41,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (48), 7 states have call predecessors, (48), 1 states have return successors, (44), 2 states have call predecessors, (44), 3 states have call successors, (44) [2022-07-21 15:36:41,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3253 states and 4376 transitions. [2022-07-21 15:36:41,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2022-07-21 15:36:41,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:36:41,196 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:36:41,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-21 15:36:41,196 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:36:41,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:36:41,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1905541260, now seen corresponding path program 1 times [2022-07-21 15:36:41,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:36:41,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464194541] [2022-07-21 15:36:41,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:36:41,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:36:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:36:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:36:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:36:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:36:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:36:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:36:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:36:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:36:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:36:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 15:36:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:36:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:36:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 15:36:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 15:36:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:36:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 15:36:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 15:36:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 15:36:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 15:36:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-21 15:36:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-21 15:36:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-21 15:36:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-21 15:36:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-21 15:36:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-21 15:36:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-21 15:36:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-21 15:36:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 15:36:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 15:36:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-07-21 15:36:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-21 15:36:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-21 15:36:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2022-07-21 15:36:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-07-21 15:36:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2022-07-21 15:36:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:41,642 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2022-07-21 15:36:41,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:36:41,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464194541] [2022-07-21 15:36:41,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464194541] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:36:41,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822260034] [2022-07-21 15:36:41,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:36:41,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:36:41,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:36:41,648 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:36:41,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 15:36:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:42,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 2936 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 15:36:42,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:36:42,534 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2022-07-21 15:36:42,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:36:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2022-07-21 15:36:42,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822260034] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 15:36:42,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 15:36:42,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 17 [2022-07-21 15:36:42,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929065937] [2022-07-21 15:36:42,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 15:36:42,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 15:36:42,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:36:42,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 15:36:42,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-07-21 15:36:42,790 INFO L87 Difference]: Start difference. First operand 3253 states and 4376 transitions. Second operand has 17 states, 17 states have (on average 10.823529411764707) internal successors, (184), 12 states have internal predecessors, (184), 3 states have call successors, (63), 7 states have call predecessors, (63), 2 states have return successors, (48), 2 states have call predecessors, (48), 3 states have call successors, (48) [2022-07-21 15:36:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:36:50,758 INFO L93 Difference]: Finished difference Result 7364 states and 10033 transitions. [2022-07-21 15:36:50,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-21 15:36:50,759 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 10.823529411764707) internal successors, (184), 12 states have internal predecessors, (184), 3 states have call successors, (63), 7 states have call predecessors, (63), 2 states have return successors, (48), 2 states have call predecessors, (48), 3 states have call successors, (48) Word has length 364 [2022-07-21 15:36:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:36:50,775 INFO L225 Difference]: With dead ends: 7364 [2022-07-21 15:36:50,775 INFO L226 Difference]: Without dead ends: 4130 [2022-07-21 15:36:50,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 831 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=678, Invalid=1484, Unknown=0, NotChecked=0, Total=2162 [2022-07-21 15:36:50,788 INFO L413 NwaCegarLoop]: 1836 mSDtfsCounter, 4833 mSDsluCounter, 3650 mSDsCounter, 0 mSdLazyCounter, 8634 mSolverCounterSat, 4992 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4833 SdHoareTripleChecker+Valid, 5486 SdHoareTripleChecker+Invalid, 13626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4992 IncrementalHoareTripleChecker+Valid, 8634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:36:50,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4833 Valid, 5486 Invalid, 13626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4992 Valid, 8634 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-07-21 15:36:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4130 states. [2022-07-21 15:36:51,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4130 to 3445. [2022-07-21 15:36:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3445 states, 2321 states have (on average 1.2098233520034467) internal successors, (2808), 2385 states have internal predecessors, (2808), 914 states have call successors, (914), 206 states have call predecessors, (914), 207 states have return successors, (918), 900 states have call predecessors, (918), 914 states have call successors, (918) [2022-07-21 15:36:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 4640 transitions. [2022-07-21 15:36:51,125 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 4640 transitions. Word has length 364 [2022-07-21 15:36:51,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:36:51,125 INFO L495 AbstractCegarLoop]: Abstraction has 3445 states and 4640 transitions. [2022-07-21 15:36:51,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.823529411764707) internal successors, (184), 12 states have internal predecessors, (184), 3 states have call successors, (63), 7 states have call predecessors, (63), 2 states have return successors, (48), 2 states have call predecessors, (48), 3 states have call successors, (48) [2022-07-21 15:36:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 4640 transitions. [2022-07-21 15:36:51,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-07-21 15:36:51,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:36:51,129 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:36:51,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 15:36:51,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:36:51,330 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:36:51,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:36:51,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1892735357, now seen corresponding path program 1 times [2022-07-21 15:36:51,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:36:51,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061113817] [2022-07-21 15:36:51,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:36:51,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:36:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:36:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:36:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:36:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:36:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:36:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:36:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:36:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:36:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:36:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 15:36:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:36:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:36:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 15:36:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 15:36:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:36:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 15:36:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 15:36:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 15:36:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 15:36:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 15:36:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-21 15:36:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-21 15:36:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-21 15:36:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 15:36:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-21 15:36:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 15:36:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-07-21 15:36:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-07-21 15:36:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2022-07-21 15:36:51,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:36:51,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061113817] [2022-07-21 15:36:51,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061113817] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:36:51,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496745599] [2022-07-21 15:36:51,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:36:51,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:36:51,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:36:51,696 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:36:51,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 15:36:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:52,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 2787 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 15:36:52,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:36:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2022-07-21 15:36:52,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:36:52,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496745599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:36:52,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:36:52,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2022-07-21 15:36:52,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123006942] [2022-07-21 15:36:52,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:36:52,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 15:36:52,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:36:52,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 15:36:52,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:36:52,505 INFO L87 Difference]: Start difference. First operand 3445 states and 4640 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-21 15:36:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:36:52,773 INFO L93 Difference]: Finished difference Result 6803 states and 9173 transitions. [2022-07-21 15:36:52,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 15:36:52,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 287 [2022-07-21 15:36:52,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:36:52,784 INFO L225 Difference]: With dead ends: 6803 [2022-07-21 15:36:52,785 INFO L226 Difference]: Without dead ends: 3357 [2022-07-21 15:36:52,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:36:52,797 INFO L413 NwaCegarLoop]: 2203 mSDtfsCounter, 3 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4401 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:36:52,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4401 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 15:36:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3357 states. [2022-07-21 15:36:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3357 to 3357. [2022-07-21 15:36:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 2241 states have (on average 1.2021419009370817) internal successors, (2694), 2305 states have internal predecessors, (2694), 908 states have call successors, (908), 204 states have call predecessors, (908), 205 states have return successors, (912), 894 states have call predecessors, (912), 908 states have call successors, (912) [2022-07-21 15:36:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4514 transitions. [2022-07-21 15:36:53,109 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4514 transitions. Word has length 287 [2022-07-21 15:36:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:36:53,109 INFO L495 AbstractCegarLoop]: Abstraction has 3357 states and 4514 transitions. [2022-07-21 15:36:53,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-21 15:36:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4514 transitions. [2022-07-21 15:36:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2022-07-21 15:36:53,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:36:53,113 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2022-07-21 15:36:53,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-21 15:36:53,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:36:53,314 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:36:53,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:36:53,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1876269791, now seen corresponding path program 1 times [2022-07-21 15:36:53,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:36:53,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943730520] [2022-07-21 15:36:53,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:36:53,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:36:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:36:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:36:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:36:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:36:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:36:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:36:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:36:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:36:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:36:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:36:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:36:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:36:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:36:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 15:36:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-21 15:36:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 15:36:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:36:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:36:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-21 15:36:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:36:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:36:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:36:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-21 15:36:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:36:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-21 15:36:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-21 15:36:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-21 15:36:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-21 15:36:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:36:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2022-07-21 15:36:53,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:36:53,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943730520] [2022-07-21 15:36:53,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943730520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:36:53,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:36:53,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 15:36:53,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646107684] [2022-07-21 15:36:53,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:36:53,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 15:36:53,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:36:53,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 15:36:53,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:36:53,721 INFO L87 Difference]: Start difference. First operand 3357 states and 4514 transitions. Second operand has 11 states, 11 states have (on average 11.0) internal successors, (121), 7 states have internal predecessors, (121), 3 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-21 15:37:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:37:03,095 INFO L93 Difference]: Finished difference Result 8001 states and 10917 transitions. [2022-07-21 15:37:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 15:37:03,096 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 7 states have internal predecessors, (121), 3 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 294 [2022-07-21 15:37:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:37:03,112 INFO L225 Difference]: With dead ends: 8001 [2022-07-21 15:37:03,112 INFO L226 Difference]: Without dead ends: 4663 [2022-07-21 15:37:03,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-07-21 15:37:03,125 INFO L413 NwaCegarLoop]: 2277 mSDtfsCounter, 4227 mSDsluCounter, 6105 mSDsCounter, 0 mSdLazyCounter, 12804 mSolverCounterSat, 4257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4417 SdHoareTripleChecker+Valid, 8382 SdHoareTripleChecker+Invalid, 17061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4257 IncrementalHoareTripleChecker+Valid, 12804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:37:03,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4417 Valid, 8382 Invalid, 17061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4257 Valid, 12804 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-07-21 15:37:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2022-07-21 15:37:03,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 3361. [2022-07-21 15:37:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3361 states, 2245 states have (on average 1.201781737193764) internal successors, (2698), 2308 states have internal predecessors, (2698), 908 states have call successors, (908), 204 states have call predecessors, (908), 205 states have return successors, (912), 895 states have call predecessors, (912), 908 states have call successors, (912) [2022-07-21 15:37:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3361 states to 3361 states and 4518 transitions. [2022-07-21 15:37:03,462 INFO L78 Accepts]: Start accepts. Automaton has 3361 states and 4518 transitions. Word has length 294 [2022-07-21 15:37:03,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:37:03,462 INFO L495 AbstractCegarLoop]: Abstraction has 3361 states and 4518 transitions. [2022-07-21 15:37:03,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 7 states have internal predecessors, (121), 3 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-21 15:37:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3361 states and 4518 transitions. [2022-07-21 15:37:03,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2022-07-21 15:37:03,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:37:03,467 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:37:03,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-21 15:37:03,467 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:37:03,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:37:03,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1681141840, now seen corresponding path program 1 times [2022-07-21 15:37:03,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:37:03,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900632236] [2022-07-21 15:37:03,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:37:03,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:37:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:37:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:37:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:37:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:37:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:37:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:37:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:37:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:37:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:37:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:37:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:37:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:37:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:37:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:37:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:37:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:37:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:37:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:37:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 15:37:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-21 15:37:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 15:37:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:37:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:37:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:37:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-21 15:37:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:37:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:37:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:37:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-21 15:37:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:03,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-21 15:37:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:04,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-21 15:37:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:04,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-21 15:37:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:04,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-07-21 15:37:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:04,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-21 15:37:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:04,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:04,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-21 15:37:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:04,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-21 15:37:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-07-21 15:37:04,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:37:04,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900632236] [2022-07-21 15:37:04,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900632236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:37:04,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:37:04,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-21 15:37:04,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427726462] [2022-07-21 15:37:04,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:37:04,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 15:37:04,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:37:04,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 15:37:04,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-07-21 15:37:04,051 INFO L87 Difference]: Start difference. First operand 3361 states and 4518 transitions. Second operand has 16 states, 16 states have (on average 7.9375) internal successors, (127), 11 states have internal predecessors, (127), 3 states have call successors, (34), 6 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-21 15:37:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:37:26,488 INFO L93 Difference]: Finished difference Result 8069 states and 11469 transitions. [2022-07-21 15:37:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-07-21 15:37:26,488 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.9375) internal successors, (127), 11 states have internal predecessors, (127), 3 states have call successors, (34), 6 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 306 [2022-07-21 15:37:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:37:26,507 INFO L225 Difference]: With dead ends: 8069 [2022-07-21 15:37:26,507 INFO L226 Difference]: Without dead ends: 8067 [2022-07-21 15:37:26,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=833, Invalid=4423, Unknown=0, NotChecked=0, Total=5256 [2022-07-21 15:37:26,510 INFO L413 NwaCegarLoop]: 4247 mSDtfsCounter, 7002 mSDsluCounter, 23286 mSDsCounter, 0 mSdLazyCounter, 31927 mSolverCounterSat, 7125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7373 SdHoareTripleChecker+Valid, 27533 SdHoareTripleChecker+Invalid, 39052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7125 IncrementalHoareTripleChecker+Valid, 31927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:37:26,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7373 Valid, 27533 Invalid, 39052 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7125 Valid, 31927 Invalid, 0 Unknown, 0 Unchecked, 20.4s Time] [2022-07-21 15:37:26,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8067 states. [2022-07-21 15:37:26,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8067 to 3372. [2022-07-21 15:37:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3372 states, 2252 states have (on average 1.2015985790408525) internal successors, (2706), 2315 states have internal predecessors, (2706), 912 states have call successors, (912), 204 states have call predecessors, (912), 205 states have return successors, (916), 899 states have call predecessors, (916), 912 states have call successors, (916) [2022-07-21 15:37:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 4534 transitions. [2022-07-21 15:37:26,895 INFO L78 Accepts]: Start accepts. Automaton has 3372 states and 4534 transitions. Word has length 306 [2022-07-21 15:37:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:37:26,896 INFO L495 AbstractCegarLoop]: Abstraction has 3372 states and 4534 transitions. [2022-07-21 15:37:26,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.9375) internal successors, (127), 11 states have internal predecessors, (127), 3 states have call successors, (34), 6 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-21 15:37:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3372 states and 4534 transitions. [2022-07-21 15:37:26,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2022-07-21 15:37:26,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:37:26,939 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:37:26,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-21 15:37:26,939 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:37:26,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:37:26,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1848139746, now seen corresponding path program 1 times [2022-07-21 15:37:26,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:37:26,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733962025] [2022-07-21 15:37:26,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:37:26,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:37:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:37:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:37:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:37:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:37:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:37:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:37:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:37:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:37:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:37:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:37:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:37:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:37:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:37:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:37:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:37:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:37:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:37:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:37:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 15:37:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-21 15:37:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 15:37:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:37:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:37:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:37:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-21 15:37:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:37:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:37:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:37:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-21 15:37:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-21 15:37:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-21 15:37:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-21 15:37:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-21 15:37:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:37:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-21 15:37:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-21 15:37:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-07-21 15:37:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:37:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2022-07-21 15:37:27,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:37:27,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733962025] [2022-07-21 15:37:27,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733962025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:37:27,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:37:27,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-21 15:37:27,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827944921] [2022-07-21 15:37:27,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:37:27,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 15:37:27,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:37:27,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 15:37:27,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-21 15:37:27,423 INFO L87 Difference]: Start difference. First operand 3372 states and 4534 transitions. Second operand has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 8 states have internal predecessors, (130), 3 states have call successors, (34), 6 states have call predecessors, (34), 2 states have return successors, (34), 4 states have call predecessors, (34), 3 states have call successors, (34)