./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--icplus--ipg.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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--icplus--ipg.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 53e062e1035ae1f01c2e809595599fa2661e1ae14b245da0f28d018a9f398780 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 04:44:30,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:44:30,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:44:30,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:44:30,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:44:30,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:44:30,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:44:30,264 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:44:30,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:44:30,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:44:30,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:44:30,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:44:30,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:44:30,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:44:30,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:44:30,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:44:30,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:44:30,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:44:30,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:44:30,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:44:30,285 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:44:30,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:44:30,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:44:30,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:44:30,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:44:30,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:44:30,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:44:30,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:44:30,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:44:30,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:44:30,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:44:30,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:44:30,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:44:30,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:44:30,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:44:30,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:44:30,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:44:30,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:44:30,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:44:30,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:44:30,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:44:30,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:44:30,302 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 04:44:30,328 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:44:30,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:44:30,329 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:44:30,329 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:44:30,330 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:44:30,330 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:44:30,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:44:30,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:44:30,330 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:44:30,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:44:30,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:44:30,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:44:30,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:44:30,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:44:30,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:44:30,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:44:30,332 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:44:30,332 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:44:30,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:44:30,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:44:30,333 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:44:30,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:44:30,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:44:30,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:44:30,334 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:44:30,334 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:44:30,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:44:30,335 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:44:30,335 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:44:30,335 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:44:30,335 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 -> 53e062e1035ae1f01c2e809595599fa2661e1ae14b245da0f28d018a9f398780 [2022-07-14 04:44:30,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:44:30,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:44:30,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:44:30,529 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:44:30,529 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:44:30,530 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--icplus--ipg.ko.cil.i [2022-07-14 04:44:30,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d4ff0b83/3ae3af0da41f4d058ba5eab420986da8/FLAG65dc10934 [2022-07-14 04:44:31,233 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:44:31,234 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--icplus--ipg.ko.cil.i [2022-07-14 04:44:31,273 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d4ff0b83/3ae3af0da41f4d058ba5eab420986da8/FLAG65dc10934 [2022-07-14 04:44:31,366 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d4ff0b83/3ae3af0da41f4d058ba5eab420986da8 [2022-07-14 04:44:31,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:44:31,369 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:44:31,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:44:31,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:44:31,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:44:31,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:44:31" (1/1) ... [2022-07-14 04:44:31,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430269ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:31, skipping insertion in model container [2022-07-14 04:44:31,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:44:31" (1/1) ... [2022-07-14 04:44:31,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:44:31,497 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:44:33,707 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--icplus--ipg.ko.cil.i[393566,393579] [2022-07-14 04:44:33,709 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--icplus--ipg.ko.cil.i[393711,393724] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[393857,393870] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[394022,394035] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[394180,394193] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[394338,394351] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[394496,394509] [2022-07-14 04:44:33,712 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--icplus--ipg.ko.cil.i[394656,394669] [2022-07-14 04:44:33,712 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--icplus--ipg.ko.cil.i[394815,394828] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[394954,394967] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[395096,395109] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[395245,395258] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[395384,395397] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[395539,395552] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[395699,395712] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[395850,395863] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[396001,396014] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[396153,396166] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[396302,396315] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[396450,396463] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[396607,396620] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[396756,396769] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[396912,396925] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[397065,397078] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[397211,397224] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[397354,397367] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[397506,397519] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[397652,397665] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[397797,397810] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[397951,397964] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[398102,398115] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[398257,398270] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[398409,398422] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[398564,398577] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[398728,398741] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[398884,398897] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[399048,399061] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[399190,399203] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[399348,399361] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[399515,399528] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[399674,399687] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[399833,399846] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[399982,399995] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[400129,400142] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[400268,400281] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[400431,400444] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[400597,400610] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[400761,400774] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[400926,400939] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[401091,401104] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[401257,401270] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[401422,401435] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[401589,401602] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[401749,401762] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[401911,401924] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[402070,402083] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[402216,402229] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[402359,402372] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[402503,402516] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[402646,402659] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[402790,402803] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[402931,402944] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[403069,403082] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[403227,403240] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[403386,403399] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[403542,403555] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[403691,403704] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[403843,403856] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[403994,404007] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[404143,404156] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[404295,404308] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[404443,404456] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[404596,404609] [2022-07-14 04:44:33,737 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--icplus--ipg.ko.cil.i[404747,404760] [2022-07-14 04:44:33,737 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--icplus--ipg.ko.cil.i[404897,404910] [2022-07-14 04:44:33,737 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--icplus--ipg.ko.cil.i[405044,405057] [2022-07-14 04:44:33,737 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--icplus--ipg.ko.cil.i[405195,405208] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[405346,405359] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[405494,405507] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[405660,405673] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[405829,405842] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[405996,406009] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[406164,406177] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[406314,406327] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[406461,406474] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[406622,406635] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[406792,406805] [2022-07-14 04:44:33,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--icplus--ipg.ko.cil.i[406954,406967] [2022-07-14 04:44:33,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:44:33,790 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:44:34,021 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--icplus--ipg.ko.cil.i[393566,393579] [2022-07-14 04:44:34,022 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--icplus--ipg.ko.cil.i[393711,393724] [2022-07-14 04:44:34,022 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--icplus--ipg.ko.cil.i[393857,393870] [2022-07-14 04:44:34,023 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--icplus--ipg.ko.cil.i[394022,394035] [2022-07-14 04:44:34,023 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--icplus--ipg.ko.cil.i[394180,394193] [2022-07-14 04:44:34,023 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--icplus--ipg.ko.cil.i[394338,394351] [2022-07-14 04:44:34,024 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--icplus--ipg.ko.cil.i[394496,394509] [2022-07-14 04:44:34,024 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--icplus--ipg.ko.cil.i[394656,394669] [2022-07-14 04:44:34,025 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--icplus--ipg.ko.cil.i[394815,394828] [2022-07-14 04:44:34,025 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--icplus--ipg.ko.cil.i[394954,394967] [2022-07-14 04:44:34,025 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--icplus--ipg.ko.cil.i[395096,395109] [2022-07-14 04:44:34,026 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--icplus--ipg.ko.cil.i[395245,395258] [2022-07-14 04:44:34,026 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--icplus--ipg.ko.cil.i[395384,395397] [2022-07-14 04:44:34,026 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--icplus--ipg.ko.cil.i[395539,395552] [2022-07-14 04:44:34,027 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--icplus--ipg.ko.cil.i[395699,395712] [2022-07-14 04:44:34,027 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--icplus--ipg.ko.cil.i[395850,395863] [2022-07-14 04:44:34,027 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--icplus--ipg.ko.cil.i[396001,396014] [2022-07-14 04:44:34,027 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--icplus--ipg.ko.cil.i[396153,396166] [2022-07-14 04:44:34,028 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--icplus--ipg.ko.cil.i[396302,396315] [2022-07-14 04:44:34,028 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--icplus--ipg.ko.cil.i[396450,396463] [2022-07-14 04:44:34,028 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--icplus--ipg.ko.cil.i[396607,396620] [2022-07-14 04:44:34,029 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--icplus--ipg.ko.cil.i[396756,396769] [2022-07-14 04:44:34,029 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--icplus--ipg.ko.cil.i[396912,396925] [2022-07-14 04:44:34,030 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--icplus--ipg.ko.cil.i[397065,397078] [2022-07-14 04:44:34,030 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--icplus--ipg.ko.cil.i[397211,397224] [2022-07-14 04:44:34,030 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--icplus--ipg.ko.cil.i[397354,397367] [2022-07-14 04:44:34,030 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--icplus--ipg.ko.cil.i[397506,397519] [2022-07-14 04:44:34,031 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--icplus--ipg.ko.cil.i[397652,397665] [2022-07-14 04:44:34,031 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--icplus--ipg.ko.cil.i[397797,397810] [2022-07-14 04:44:34,031 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--icplus--ipg.ko.cil.i[397951,397964] [2022-07-14 04:44:34,032 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--icplus--ipg.ko.cil.i[398102,398115] [2022-07-14 04:44:34,033 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--icplus--ipg.ko.cil.i[398257,398270] [2022-07-14 04:44:34,033 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--icplus--ipg.ko.cil.i[398409,398422] [2022-07-14 04:44:34,033 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--icplus--ipg.ko.cil.i[398564,398577] [2022-07-14 04:44:34,034 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--icplus--ipg.ko.cil.i[398728,398741] [2022-07-14 04:44:34,034 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--icplus--ipg.ko.cil.i[398884,398897] [2022-07-14 04:44:34,035 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--icplus--ipg.ko.cil.i[399048,399061] [2022-07-14 04:44:34,035 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--icplus--ipg.ko.cil.i[399190,399203] [2022-07-14 04:44:34,035 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--icplus--ipg.ko.cil.i[399348,399361] [2022-07-14 04:44:34,036 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--icplus--ipg.ko.cil.i[399515,399528] [2022-07-14 04:44:34,037 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--icplus--ipg.ko.cil.i[399674,399687] [2022-07-14 04:44:34,037 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--icplus--ipg.ko.cil.i[399833,399846] [2022-07-14 04:44:34,037 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--icplus--ipg.ko.cil.i[399982,399995] [2022-07-14 04:44:34,037 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--icplus--ipg.ko.cil.i[400129,400142] [2022-07-14 04:44:34,038 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--icplus--ipg.ko.cil.i[400268,400281] [2022-07-14 04:44:34,038 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--icplus--ipg.ko.cil.i[400431,400444] [2022-07-14 04:44:34,038 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--icplus--ipg.ko.cil.i[400597,400610] [2022-07-14 04:44:34,039 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--icplus--ipg.ko.cil.i[400761,400774] [2022-07-14 04:44:34,039 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--icplus--ipg.ko.cil.i[400926,400939] [2022-07-14 04:44:34,039 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--icplus--ipg.ko.cil.i[401091,401104] [2022-07-14 04:44:34,040 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--icplus--ipg.ko.cil.i[401257,401270] [2022-07-14 04:44:34,040 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--icplus--ipg.ko.cil.i[401422,401435] [2022-07-14 04:44:34,040 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--icplus--ipg.ko.cil.i[401589,401602] [2022-07-14 04:44:34,040 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--icplus--ipg.ko.cil.i[401749,401762] [2022-07-14 04:44:34,041 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--icplus--ipg.ko.cil.i[401911,401924] [2022-07-14 04:44:34,041 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--icplus--ipg.ko.cil.i[402070,402083] [2022-07-14 04:44:34,041 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--icplus--ipg.ko.cil.i[402216,402229] [2022-07-14 04:44:34,042 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--icplus--ipg.ko.cil.i[402359,402372] [2022-07-14 04:44:34,042 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--icplus--ipg.ko.cil.i[402503,402516] [2022-07-14 04:44:34,042 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--icplus--ipg.ko.cil.i[402646,402659] [2022-07-14 04:44:34,042 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--icplus--ipg.ko.cil.i[402790,402803] [2022-07-14 04:44:34,043 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--icplus--ipg.ko.cil.i[402931,402944] [2022-07-14 04:44:34,047 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--icplus--ipg.ko.cil.i[403069,403082] [2022-07-14 04:44:34,049 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--icplus--ipg.ko.cil.i[403227,403240] [2022-07-14 04:44:34,049 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--icplus--ipg.ko.cil.i[403386,403399] [2022-07-14 04:44:34,049 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--icplus--ipg.ko.cil.i[403542,403555] [2022-07-14 04:44:34,050 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--icplus--ipg.ko.cil.i[403691,403704] [2022-07-14 04:44:34,051 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--icplus--ipg.ko.cil.i[403843,403856] [2022-07-14 04:44:34,051 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--icplus--ipg.ko.cil.i[403994,404007] [2022-07-14 04:44:34,051 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--icplus--ipg.ko.cil.i[404143,404156] [2022-07-14 04:44:34,051 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--icplus--ipg.ko.cil.i[404295,404308] [2022-07-14 04:44:34,052 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--icplus--ipg.ko.cil.i[404443,404456] [2022-07-14 04:44:34,056 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--icplus--ipg.ko.cil.i[404596,404609] [2022-07-14 04:44:34,056 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--icplus--ipg.ko.cil.i[404747,404760] [2022-07-14 04:44:34,056 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--icplus--ipg.ko.cil.i[404897,404910] [2022-07-14 04:44:34,057 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--icplus--ipg.ko.cil.i[405044,405057] [2022-07-14 04:44:34,057 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--icplus--ipg.ko.cil.i[405195,405208] [2022-07-14 04:44:34,057 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--icplus--ipg.ko.cil.i[405346,405359] [2022-07-14 04:44:34,058 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--icplus--ipg.ko.cil.i[405494,405507] [2022-07-14 04:44:34,059 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--icplus--ipg.ko.cil.i[405660,405673] [2022-07-14 04:44:34,059 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--icplus--ipg.ko.cil.i[405829,405842] [2022-07-14 04:44:34,060 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--icplus--ipg.ko.cil.i[405996,406009] [2022-07-14 04:44:34,060 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--icplus--ipg.ko.cil.i[406164,406177] [2022-07-14 04:44:34,060 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--icplus--ipg.ko.cil.i[406314,406327] [2022-07-14 04:44:34,060 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--icplus--ipg.ko.cil.i[406461,406474] [2022-07-14 04:44:34,061 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--icplus--ipg.ko.cil.i[406622,406635] [2022-07-14 04:44:34,061 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--icplus--ipg.ko.cil.i[406792,406805] [2022-07-14 04:44:34,061 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--icplus--ipg.ko.cil.i[406954,406967] [2022-07-14 04:44:34,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:44:34,226 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:44:34,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:34 WrapperNode [2022-07-14 04:44:34,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:44:34,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:44:34,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:44:34,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:44:34,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:34" (1/1) ... [2022-07-14 04:44:34,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:34" (1/1) ... [2022-07-14 04:44:34,439 INFO L137 Inliner]: procedures = 655, calls = 1960, calls flagged for inlining = 296, calls inlined = 213, statements flattened = 4413 [2022-07-14 04:44:34,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:44:34,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:44:34,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:44:34,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:44:34,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:34" (1/1) ... [2022-07-14 04:44:34,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:34" (1/1) ... [2022-07-14 04:44:34,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:34" (1/1) ... [2022-07-14 04:44:34,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:34" (1/1) ... [2022-07-14 04:44:34,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:34" (1/1) ... [2022-07-14 04:44:34,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:34" (1/1) ... [2022-07-14 04:44:34,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:34" (1/1) ... [2022-07-14 04:44:34,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:44:34,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:44:34,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:44:34,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:44:34,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:34" (1/1) ... [2022-07-14 04:44:34,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:44:34,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:44:34,653 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-14 04:44:34,675 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-14 04:44:34,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:44:34,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:44:34,685 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_write [2022-07-14 04:44:34,685 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_write [2022-07-14 04:44:34,685 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2022-07-14 04:44:34,685 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2022-07-14 04:44:34,685 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-14 04:44:34,685 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-14 04:44:34,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:44:34,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:44:34,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mii_mutex_of_ipg_nic_private [2022-07-14 04:44:34,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mii_mutex_of_ipg_nic_private [2022-07-14 04:44:34,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:44:34,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:44:34,686 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-14 04:44:34,686 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-14 04:44:34,686 INFO L130 BoogieDeclarations]: Found specification of procedure init_tfdlist [2022-07-14 04:44:34,686 INFO L138 BoogieDeclarations]: Found implementation of procedure init_tfdlist [2022-07-14 04:44:34,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 04:44:34,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 04:44:34,687 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-07-14 04:44:34,687 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-07-14 04:44:34,687 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite16 [2022-07-14 04:44:34,687 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite16 [2022-07-14 04:44:34,687 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_set_multicast_list [2022-07-14 04:44:34,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_set_multicast_list [2022-07-14 04:44:34,687 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite8 [2022-07-14 04:44:34,687 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite8 [2022-07-14 04:44:34,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:44:34,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:44:34,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:44:34,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:44:34,710 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32 [2022-07-14 04:44:34,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32 [2022-07-14 04:44:34,710 INFO L130 BoogieDeclarations]: Found specification of procedure pci_name [2022-07-14 04:44:34,710 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_name [2022-07-14 04:44:34,710 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_rx_clear [2022-07-14 04:44:34,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_rx_clear [2022-07-14 04:44:34,710 INFO L130 BoogieDeclarations]: Found specification of procedure skb_checksum_none_assert [2022-07-14 04:44:34,710 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_checksum_none_assert [2022-07-14 04:44:34,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 04:44:34,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 04:44:34,710 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32 [2022-07-14 04:44:34,711 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32 [2022-07-14 04:44:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2022-07-14 04:44:34,711 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2022-07-14 04:44:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-07-14 04:44:34,711 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-07-14 04:44:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:44:34,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:44:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:44:34,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:44:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_single [2022-07-14 04:44:34,711 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_single [2022-07-14 04:44:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 04:44:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure read_phy_bit [2022-07-14 04:44:34,711 INFO L138 BoogieDeclarations]: Found implementation of procedure read_phy_bit [2022-07-14 04:44:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:44:34,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:44:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_remove [2022-07-14 04:44:34,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_remove [2022-07-14 04:44:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-14 04:44:34,711 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-14 04:44:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 04:44:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-14 04:44:34,711 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-14 04:44:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_open [2022-07-14 04:44:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_open [2022-07-14 04:44:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 04:44:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-14 04:44:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-14 04:44:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:44:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:44:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:44:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:44:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:44:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:44:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:44:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-14 04:44:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-14 04:44:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 04:44:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 04:44:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:44:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:44:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-07-14 04:44:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-07-14 04:44:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-14 04:44:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-14 04:44:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-14 04:44:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-14 04:44:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_dma_mask [2022-07-14 04:44:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_set_dma_mask [2022-07-14 04:44:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-07-14 04:44:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-07-14 04:44:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:44:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:44:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-14 04:44:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-14 04:44:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:44:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:44:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_get_stats [2022-07-14 04:44:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_get_stats [2022-07-14 04:44:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_rxrestore [2022-07-14 04:44:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_rxrestore [2022-07-14 04:44:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:44:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_ipg_nic_private [2022-07-14 04:44:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_ipg_nic_private [2022-07-14 04:44:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:44:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:44:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:44:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-14 04:44:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-14 04:44:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 04:44:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure ioread16 [2022-07-14 04:44:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread16 [2022-07-14 04:44:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:44:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:44:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_ioaddr [2022-07-14 04:44:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_ioaddr [2022-07-14 04:44:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:44:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:44:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure ioread8 [2022-07-14 04:44:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread8 [2022-07-14 04:44:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-14 04:44:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-14 04:44:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-14 04:44:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-14 04:44:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:44:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:44:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-14 04:44:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-14 04:44:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_get_rxbuff [2022-07-14 04:44:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_get_rxbuff [2022-07-14 04:44:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_write_phy_ctl [2022-07-14 04:44:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_write_phy_ctl [2022-07-14 04:44:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2022-07-14 04:44:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2022-07-14 04:44:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-14 04:44:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-14 04:44:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_drive_phy_ctl_low_high [2022-07-14 04:44:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_drive_phy_ctl_low_high [2022-07-14 04:44:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_read [2022-07-14 04:44:34,715 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_read [2022-07-14 04:44:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:44:34,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:44:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_txfree [2022-07-14 04:44:34,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_txfree [2022-07-14 04:44:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 04:44:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 04:44:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:44:34,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:44:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_tx_timeout [2022-07-14 04:44:34,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_tx_timeout [2022-07-14 04:44:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 04:44:34,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 04:44:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-07-14 04:44:34,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-07-14 04:44:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure pci_map_single [2022-07-14 04:44:34,719 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_map_single [2022-07-14 04:44:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-14 04:44:34,719 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-14 04:44:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:44:34,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:44:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_tx_clear [2022-07-14 04:44:34,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_tx_clear [2022-07-14 04:44:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:44:34,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:44:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure read_eeprom [2022-07-14 04:44:34,720 INFO L138 BoogieDeclarations]: Found implementation of procedure read_eeprom [2022-07-14 04:44:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 04:44:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:44:34,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:44:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-14 04:44:34,721 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-14 04:44:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 04:44:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_rx_free_skb [2022-07-14 04:44:34,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_rx_free_skb [2022-07-14 04:44:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure send_three_state [2022-07-14 04:44:34,721 INFO L138 BoogieDeclarations]: Found implementation of procedure send_three_state [2022-07-14 04:44:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:44:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-14 04:44:34,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-14 04:44:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:44:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:44:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-14 04:44:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-14 04:44:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:44:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:44:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-14 04:44:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-14 04:44:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-07-14 04:44:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-07-14 04:44:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_io_config [2022-07-14 04:44:34,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_io_config [2022-07-14 04:44:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure init_rfdlist [2022-07-14 04:44:34,723 INFO L138 BoogieDeclarations]: Found implementation of procedure init_rfdlist [2022-07-14 04:44:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:44:34,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:44:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure dma_free_attrs [2022-07-14 04:44:34,723 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_free_attrs [2022-07-14 04:44:34,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:44:34,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:44:34,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:44:34,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:44:34,725 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-14 04:44:34,725 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-14 04:44:34,725 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-14 04:44:34,725 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-14 04:44:34,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:44:34,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:44:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:44:34,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:44:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 04:44:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:44:34,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:44:34,727 INFO L130 BoogieDeclarations]: Found specification of procedure eth_type_trans [2022-07-14 04:44:34,727 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_type_trans [2022-07-14 04:44:34,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 04:44:34,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 04:44:34,727 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nway_reset [2022-07-14 04:44:34,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nway_reset [2022-07-14 04:44:34,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:44:34,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:44:34,727 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_stop [2022-07-14 04:44:34,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_stop [2022-07-14 04:44:34,728 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_config_autoneg [2022-07-14 04:44:34,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_config_autoneg [2022-07-14 04:44:34,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-14 04:44:34,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-14 04:44:34,728 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_reset [2022-07-14 04:44:34,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_reset [2022-07-14 04:44:34,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_ipg_nic_private [2022-07-14 04:44:34,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_ipg_nic_private [2022-07-14 04:44:34,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mii_mutex_of_ipg_nic_private [2022-07-14 04:44:34,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mii_mutex_of_ipg_nic_private [2022-07-14 04:44:34,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:44:34,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:44:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure pci_iounmap [2022-07-14 04:44:34,731 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_iounmap [2022-07-14 04:44:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure dma_alloc_attrs [2022-07-14 04:44:34,731 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_alloc_attrs [2022-07-14 04:44:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2022-07-14 04:44:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:44:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_rx_check_error [2022-07-14 04:44:34,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_rx_check_error [2022-07-14 04:44:35,324 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:44:35,326 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:44:36,321 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:44:38,182 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:44:38,201 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:44:38,201 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 04:44:38,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:44:38 BoogieIcfgContainer [2022-07-14 04:44:38,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:44:38,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:44:38,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:44:38,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:44:38,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:44:31" (1/3) ... [2022-07-14 04:44:38,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d686ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:44:38, skipping insertion in model container [2022-07-14 04:44:38,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:34" (2/3) ... [2022-07-14 04:44:38,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d686ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:44:38, skipping insertion in model container [2022-07-14 04:44:38,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:44:38" (3/3) ... [2022-07-14 04:44:38,211 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i [2022-07-14 04:44:38,221 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:44:38,221 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-07-14 04:44:38,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:44:38,297 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@5d9c1831, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1522d2cf [2022-07-14 04:44:38,297 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-07-14 04:44:38,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 1906 states, 1308 states have (on average 1.3363914373088686) internal successors, (1748), 1377 states have internal predecessors, (1748), 457 states have call successors, (457), 114 states have call predecessors, (457), 113 states have return successors, (453), 450 states have call predecessors, (453), 453 states have call successors, (453) [2022-07-14 04:44:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-14 04:44:38,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:44:38,314 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-14 04:44:38,314 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 27 more)] === [2022-07-14 04:44:38,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:44:38,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1162119722, now seen corresponding path program 1 times [2022-07-14 04:44:38,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:44:38,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104468760] [2022-07-14 04:44:38,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:44:38,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:44:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:38,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:44:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:38,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:44:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:38,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:44:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:38,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:44:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:38,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:44:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:38,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:44:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:38,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:44:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:38,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:44:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:38,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:44:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:38,876 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-14 04:44:38,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:44:38,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104468760] [2022-07-14 04:44:38,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104468760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:44:38,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:44:38,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:44:38,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76050366] [2022-07-14 04:44:38,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:44:38,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:44:38,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:44:38,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:44:38,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:44:38,907 INFO L87 Difference]: Start difference. First operand has 1906 states, 1308 states have (on average 1.3363914373088686) internal successors, (1748), 1377 states have internal predecessors, (1748), 457 states have call successors, (457), 114 states have call predecessors, (457), 113 states have return successors, (453), 450 states have call predecessors, (453), 453 states have call successors, (453) 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-14 04:44:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:44:43,147 INFO L93 Difference]: Finished difference Result 3773 states and 5399 transitions. [2022-07-14 04:44:43,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:44:43,150 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-14 04:44:43,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:44:43,168 INFO L225 Difference]: With dead ends: 3773 [2022-07-14 04:44:43,168 INFO L226 Difference]: Without dead ends: 1882 [2022-07-14 04:44:43,183 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-14 04:44:43,185 INFO L413 NwaCegarLoop]: 2206 mSDtfsCounter, 4220 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 2120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4360 SdHoareTripleChecker+Valid, 3440 SdHoareTripleChecker+Invalid, 4724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2120 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:44:43,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4360 Valid, 3440 Invalid, 4724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2120 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-14 04:44:43,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-07-14 04:44:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1882. [2022-07-14 04:44:43,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1291 states have (on average 1.2354763749031759) internal successors, (1595), 1356 states have internal predecessors, (1595), 451 states have call successors, (451), 113 states have call predecessors, (451), 112 states have return successors, (449), 446 states have call predecessors, (449), 449 states have call successors, (449) [2022-07-14 04:44:43,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2495 transitions. [2022-07-14 04:44:43,330 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2495 transitions. Word has length 64 [2022-07-14 04:44:43,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:44:43,332 INFO L495 AbstractCegarLoop]: Abstraction has 1882 states and 2495 transitions. [2022-07-14 04:44:43,333 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-14 04:44:43,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2495 transitions. [2022-07-14 04:44:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 04:44:43,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:44:43,340 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-14 04:44:43,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:44:43,340 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 27 more)] === [2022-07-14 04:44:43,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:44:43,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1567625636, now seen corresponding path program 1 times [2022-07-14 04:44:43,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:44:43,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159600085] [2022-07-14 04:44:43,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:44:43,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:44:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:43,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:44:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:43,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:44:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:43,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:44:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:43,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:44:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:43,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:44:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:43,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:44:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:43,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:44:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:43,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:44:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:43,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:44:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:43,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:44:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:43,593 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-14 04:44:43,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:44:43,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159600085] [2022-07-14 04:44:43,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159600085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:44:43,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:44:43,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:44:43,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227899330] [2022-07-14 04:44:43,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:44:43,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:44:43,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:44:43,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:44:43,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:44:43,601 INFO L87 Difference]: Start difference. First operand 1882 states and 2495 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-14 04:44:47,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:44:47,188 INFO L93 Difference]: Finished difference Result 1882 states and 2495 transitions. [2022-07-14 04:44:47,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:44:47,188 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-14 04:44:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:44:47,198 INFO L225 Difference]: With dead ends: 1882 [2022-07-14 04:44:47,198 INFO L226 Difference]: Without dead ends: 1880 [2022-07-14 04:44:47,201 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-14 04:44:47,202 INFO L413 NwaCegarLoop]: 2188 mSDtfsCounter, 4188 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4325 SdHoareTripleChecker+Valid, 3406 SdHoareTripleChecker+Invalid, 4702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:44:47,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4325 Valid, 3406 Invalid, 4702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-14 04:44:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2022-07-14 04:44:47,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1880. [2022-07-14 04:44:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1290 states have (on average 1.2348837209302326) internal successors, (1593), 1354 states have internal predecessors, (1593), 451 states have call successors, (451), 113 states have call predecessors, (451), 112 states have return successors, (449), 446 states have call predecessors, (449), 449 states have call successors, (449) [2022-07-14 04:44:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2493 transitions. [2022-07-14 04:44:47,261 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2493 transitions. Word has length 70 [2022-07-14 04:44:47,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:44:47,263 INFO L495 AbstractCegarLoop]: Abstraction has 1880 states and 2493 transitions. [2022-07-14 04:44:47,263 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-14 04:44:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2493 transitions. [2022-07-14 04:44:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-14 04:44:47,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:44:47,264 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-14 04:44:47,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:44:47,265 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 27 more)] === [2022-07-14 04:44:47,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:44:47,265 INFO L85 PathProgramCache]: Analyzing trace with hash 287456320, now seen corresponding path program 1 times [2022-07-14 04:44:47,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:44:47,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702869197] [2022-07-14 04:44:47,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:44:47,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:44:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:47,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:44:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:47,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:44:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:47,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:44:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:47,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:44:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:47,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:44:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:47,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:44:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:47,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:44:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:47,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:44:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:47,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:44:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:47,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:44:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:47,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:44:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:47,517 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-14 04:44:47,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:44:47,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702869197] [2022-07-14 04:44:47,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702869197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:44:47,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:44:47,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:44:47,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425736259] [2022-07-14 04:44:47,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:44:47,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:44:47,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:44:47,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:44:47,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:44:47,520 INFO L87 Difference]: Start difference. First operand 1880 states and 2493 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-14 04:44:51,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:44:51,015 INFO L93 Difference]: Finished difference Result 1880 states and 2493 transitions. [2022-07-14 04:44:51,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:44:51,016 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-14 04:44:51,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:44:51,024 INFO L225 Difference]: With dead ends: 1880 [2022-07-14 04:44:51,024 INFO L226 Difference]: Without dead ends: 1878 [2022-07-14 04:44:51,025 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-14 04:44:51,025 INFO L413 NwaCegarLoop]: 2186 mSDtfsCounter, 4182 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2588 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4318 SdHoareTripleChecker+Valid, 3404 SdHoareTripleChecker+Invalid, 4700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:44:51,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4318 Valid, 3404 Invalid, 4700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2588 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-14 04:44:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2022-07-14 04:44:51,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1878. [2022-07-14 04:44:51,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1289 states have (on average 1.2342901474010861) internal successors, (1591), 1352 states have internal predecessors, (1591), 451 states have call successors, (451), 113 states have call predecessors, (451), 112 states have return successors, (449), 446 states have call predecessors, (449), 449 states have call successors, (449) [2022-07-14 04:44:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2491 transitions. [2022-07-14 04:44:51,078 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2491 transitions. Word has length 76 [2022-07-14 04:44:51,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:44:51,079 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 2491 transitions. [2022-07-14 04:44:51,079 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-14 04:44:51,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2491 transitions. [2022-07-14 04:44:51,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-14 04:44:51,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:44:51,081 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-14 04:44:51,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 04:44:51,081 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 27 more)] === [2022-07-14 04:44:51,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:44:51,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1590539557, now seen corresponding path program 1 times [2022-07-14 04:44:51,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:44:51,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111906903] [2022-07-14 04:44:51,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:44:51,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:44:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:51,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:44:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:51,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:44:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:51,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:44:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:51,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:44:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:51,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:44:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:51,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:44:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:51,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:44:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:51,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:44:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:51,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:44:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:51,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:44:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:51,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:44:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:51,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:44:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:51,293 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-14 04:44:51,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:44:51,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111906903] [2022-07-14 04:44:51,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111906903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:44:51,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:44:51,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:44:51,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598625428] [2022-07-14 04:44:51,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:44:51,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:44:51,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:44:51,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:44:51,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:44:51,296 INFO L87 Difference]: Start difference. First operand 1878 states and 2491 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-14 04:44:54,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:44:54,833 INFO L93 Difference]: Finished difference Result 1878 states and 2491 transitions. [2022-07-14 04:44:54,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:44:54,833 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-14 04:44:54,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:44:54,841 INFO L225 Difference]: With dead ends: 1878 [2022-07-14 04:44:54,841 INFO L226 Difference]: Without dead ends: 1876 [2022-07-14 04:44:54,842 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-14 04:44:54,842 INFO L413 NwaCegarLoop]: 2184 mSDtfsCounter, 4176 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4311 SdHoareTripleChecker+Valid, 3402 SdHoareTripleChecker+Invalid, 4698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:44:54,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4311 Valid, 3402 Invalid, 4698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-14 04:44:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2022-07-14 04:44:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1876. [2022-07-14 04:44:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1288 states have (on average 1.233695652173913) internal successors, (1589), 1350 states have internal predecessors, (1589), 451 states have call successors, (451), 113 states have call predecessors, (451), 112 states have return successors, (449), 446 states have call predecessors, (449), 449 states have call successors, (449) [2022-07-14 04:44:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2489 transitions. [2022-07-14 04:44:54,931 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2489 transitions. Word has length 82 [2022-07-14 04:44:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:44:54,931 INFO L495 AbstractCegarLoop]: Abstraction has 1876 states and 2489 transitions. [2022-07-14 04:44:54,932 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-14 04:44:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2489 transitions. [2022-07-14 04:44:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-14 04:44:54,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:44:54,933 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-14 04:44:54,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 04:44:54,933 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 27 more)] === [2022-07-14 04:44:54,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:44:54,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1066774035, now seen corresponding path program 1 times [2022-07-14 04:44:54,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:44:54,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911412897] [2022-07-14 04:44:54,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:44:54,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:44:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:55,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:44:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:55,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:44:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:55,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:44:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:55,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:44:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:55,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:44:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:55,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:44:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:55,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:44:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:55,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:44:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:55,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:44:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:55,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:44:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:55,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:44:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:55,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:44:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:55,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:44:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:55,128 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-14 04:44:55,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:44:55,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911412897] [2022-07-14 04:44:55,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911412897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:44:55,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:44:55,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:44:55,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044042422] [2022-07-14 04:44:55,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:44:55,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:44:55,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:44:55,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:44:55,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:44:55,130 INFO L87 Difference]: Start difference. First operand 1876 states and 2489 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-14 04:44:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:44:58,369 INFO L93 Difference]: Finished difference Result 1876 states and 2489 transitions. [2022-07-14 04:44:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:44:58,370 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-14 04:44:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:44:58,376 INFO L225 Difference]: With dead ends: 1876 [2022-07-14 04:44:58,376 INFO L226 Difference]: Without dead ends: 1874 [2022-07-14 04:44:58,377 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-14 04:44:58,377 INFO L413 NwaCegarLoop]: 2182 mSDtfsCounter, 4170 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2584 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4304 SdHoareTripleChecker+Valid, 3400 SdHoareTripleChecker+Invalid, 4696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:44:58,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4304 Valid, 3400 Invalid, 4696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2584 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-14 04:44:58,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2022-07-14 04:44:58,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1874. [2022-07-14 04:44:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1287 states have (on average 1.2331002331002332) internal successors, (1587), 1348 states have internal predecessors, (1587), 451 states have call successors, (451), 113 states have call predecessors, (451), 112 states have return successors, (449), 446 states have call predecessors, (449), 449 states have call successors, (449) [2022-07-14 04:44:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2487 transitions. [2022-07-14 04:44:58,421 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2487 transitions. Word has length 88 [2022-07-14 04:44:58,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:44:58,421 INFO L495 AbstractCegarLoop]: Abstraction has 1874 states and 2487 transitions. [2022-07-14 04:44:58,422 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-14 04:44:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2487 transitions. [2022-07-14 04:44:58,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-14 04:44:58,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:44:58,423 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, 1] [2022-07-14 04:44:58,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 04:44:58,423 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 27 more)] === [2022-07-14 04:44:58,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:44:58,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1702010873, now seen corresponding path program 1 times [2022-07-14 04:44:58,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:44:58,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666527137] [2022-07-14 04:44:58,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:44:58,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:44:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:44:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:44:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:44:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:44:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:44:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:44:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:44:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:44:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:44:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:44:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:44:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:44:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:44:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:44:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:44:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:44:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:44:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:44:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:58,607 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-14 04:44:58,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:44:58,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666527137] [2022-07-14 04:44:58,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666527137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:44:58,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:44:58,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:44:58,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184539964] [2022-07-14 04:44:58,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:44:58,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:44:58,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:44:58,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:44:58,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:44:58,610 INFO L87 Difference]: Start difference. First operand 1874 states and 2487 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 3 states have internal predecessors, (40), 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-14 04:45:04,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:04,047 INFO L93 Difference]: Finished difference Result 5136 states and 6865 transitions. [2022-07-14 04:45:04,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:45:04,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 3 states have internal predecessors, (40), 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 111 [2022-07-14 04:45:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:04,063 INFO L225 Difference]: With dead ends: 5136 [2022-07-14 04:45:04,064 INFO L226 Difference]: Without dead ends: 3283 [2022-07-14 04:45:04,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:45:04,072 INFO L413 NwaCegarLoop]: 2888 mSDtfsCounter, 6442 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 3915 mSolverCounterSat, 4036 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6590 SdHoareTripleChecker+Valid, 4486 SdHoareTripleChecker+Invalid, 7951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4036 IncrementalHoareTripleChecker+Valid, 3915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:04,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6590 Valid, 4486 Invalid, 7951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4036 Valid, 3915 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-14 04:45:04,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2022-07-14 04:45:04,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 3122. [2022-07-14 04:45:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 2165 states have (on average 1.2397228637413396) internal successors, (2684), 2253 states have internal predecessors, (2684), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:45:04,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 4170 transitions. [2022-07-14 04:45:04,201 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 4170 transitions. Word has length 111 [2022-07-14 04:45:04,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:04,202 INFO L495 AbstractCegarLoop]: Abstraction has 3122 states and 4170 transitions. [2022-07-14 04:45:04,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 3 states have internal predecessors, (40), 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-14 04:45:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 4170 transitions. [2022-07-14 04:45:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-14 04:45:04,203 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:04,203 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-14 04:45:04,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 04:45:04,203 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 27 more)] === [2022-07-14 04:45:04,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:04,204 INFO L85 PathProgramCache]: Analyzing trace with hash -249621299, now seen corresponding path program 1 times [2022-07-14 04:45:04,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:04,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741163012] [2022-07-14 04:45:04,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:04,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:04,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:04,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:04,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:04,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:04,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:04,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:04,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:04,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:04,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:04,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:04,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:04,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:04,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:04,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:45:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:04,407 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-14 04:45:04,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:04,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741163012] [2022-07-14 04:45:04,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741163012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:04,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:04,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:04,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218586744] [2022-07-14 04:45:04,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:04,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:04,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:04,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:04,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:04,410 INFO L87 Difference]: Start difference. First operand 3122 states and 4170 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-14 04:45:07,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:07,868 INFO L93 Difference]: Finished difference Result 3122 states and 4170 transitions. [2022-07-14 04:45:07,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:07,879 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-14 04:45:07,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:07,889 INFO L225 Difference]: With dead ends: 3122 [2022-07-14 04:45:07,890 INFO L226 Difference]: Without dead ends: 3120 [2022-07-14 04:45:07,890 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-14 04:45:07,891 INFO L413 NwaCegarLoop]: 2180 mSDtfsCounter, 4164 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4297 SdHoareTripleChecker+Valid, 3398 SdHoareTripleChecker+Invalid, 4694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:07,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4297 Valid, 3398 Invalid, 4694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2582 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-14 04:45:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2022-07-14 04:45:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 3120. [2022-07-14 04:45:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3120 states, 2164 states have (on average 1.2393715341959335) internal successors, (2682), 2251 states have internal predecessors, (2682), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:45:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 4168 transitions. [2022-07-14 04:45:07,999 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 4168 transitions. Word has length 94 [2022-07-14 04:45:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:08,000 INFO L495 AbstractCegarLoop]: Abstraction has 3120 states and 4168 transitions. [2022-07-14 04:45:08,000 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-14 04:45:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 4168 transitions. [2022-07-14 04:45:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-14 04:45:08,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:08,003 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, 1] [2022-07-14 04:45:08,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:45:08,003 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 27 more)] === [2022-07-14 04:45:08,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:08,004 INFO L85 PathProgramCache]: Analyzing trace with hash 333765064, now seen corresponding path program 1 times [2022-07-14 04:45:08,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:08,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133105924] [2022-07-14 04:45:08,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:08,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:45:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:45:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:45:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:45:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:45:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:45:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:45:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:45:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:45:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:45:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:45:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:45:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:45:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,212 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-14 04:45:08,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:08,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133105924] [2022-07-14 04:45:08,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133105924] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:45:08,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64209700] [2022-07-14 04:45:08,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:08,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:45:08,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:45:08,215 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-14 04:45:08,256 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-14 04:45:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 1917 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 04:45:08,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:45:08,870 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-14 04:45:08,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:45:08,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64209700] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:08,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:45:08,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-14 04:45:08,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453491321] [2022-07-14 04:45:08,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:08,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 04:45:08,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:08,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 04:45:08,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:45:08,872 INFO L87 Difference]: Start difference. First operand 3120 states and 4168 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-14 04:45:08,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:08,989 INFO L93 Difference]: Finished difference Result 6215 states and 8301 transitions. [2022-07-14 04:45:08,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 04:45:08,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 117 [2022-07-14 04:45:08,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:09,002 INFO L225 Difference]: With dead ends: 6215 [2022-07-14 04:45:09,002 INFO L226 Difference]: Without dead ends: 3116 [2022-07-14 04:45:09,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 151 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-14 04:45:09,013 INFO L413 NwaCegarLoop]: 2479 mSDtfsCounter, 2462 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2462 SdHoareTripleChecker+Valid, 2479 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-14 04:45:09,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2462 Valid, 2479 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 04:45:09,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2022-07-14 04:45:09,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 3116. [2022-07-14 04:45:09,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3116 states, 2161 states have (on average 1.2387783433595558) internal successors, (2677), 2247 states have internal predecessors, (2677), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:45:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 4163 transitions. [2022-07-14 04:45:09,161 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 4163 transitions. Word has length 117 [2022-07-14 04:45:09,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:09,162 INFO L495 AbstractCegarLoop]: Abstraction has 3116 states and 4163 transitions. [2022-07-14 04:45:09,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-14 04:45:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 4163 transitions. [2022-07-14 04:45:09,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-14 04:45:09,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:09,165 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-14 04:45:09,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 04:45:09,388 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-14 04:45:09,388 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 27 more)] === [2022-07-14 04:45:09,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:09,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1509829772, now seen corresponding path program 1 times [2022-07-14 04:45:09,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:09,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632114469] [2022-07-14 04:45:09,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:09,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:09,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:09,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:09,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:09,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:09,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:09,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:09,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:09,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:09,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:09,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:09,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:09,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:09,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:09,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:45:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:09,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:45:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:09,591 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-14 04:45:09,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:09,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632114469] [2022-07-14 04:45:09,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632114469] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:09,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:09,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:09,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343434136] [2022-07-14 04:45:09,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:09,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:09,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:09,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:09,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:09,593 INFO L87 Difference]: Start difference. First operand 3116 states and 4163 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-14 04:45:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:13,277 INFO L93 Difference]: Finished difference Result 3116 states and 4163 transitions. [2022-07-14 04:45:13,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:13,277 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-14 04:45:13,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:13,288 INFO L225 Difference]: With dead ends: 3116 [2022-07-14 04:45:13,288 INFO L226 Difference]: Without dead ends: 3114 [2022-07-14 04:45:13,289 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-14 04:45:13,290 INFO L413 NwaCegarLoop]: 2173 mSDtfsCounter, 4153 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2579 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4285 SdHoareTripleChecker+Valid, 3377 SdHoareTripleChecker+Invalid, 4691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:13,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4285 Valid, 3377 Invalid, 4691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2579 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-14 04:45:13,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2022-07-14 04:45:13,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3114. [2022-07-14 04:45:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3114 states, 2160 states have (on average 1.2384259259259258) internal successors, (2675), 2245 states have internal predecessors, (2675), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:45:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 4161 transitions. [2022-07-14 04:45:13,398 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 4161 transitions. Word has length 100 [2022-07-14 04:45:13,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:13,398 INFO L495 AbstractCegarLoop]: Abstraction has 3114 states and 4161 transitions. [2022-07-14 04:45:13,398 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-14 04:45:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 4161 transitions. [2022-07-14 04:45:13,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-14 04:45:13,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:13,400 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-14 04:45:13,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 04:45:13,400 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 27 more)] === [2022-07-14 04:45:13,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:13,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1795905648, now seen corresponding path program 1 times [2022-07-14 04:45:13,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:13,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741716047] [2022-07-14 04:45:13,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:13,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:13,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:13,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:13,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:13,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:13,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:13,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:13,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:13,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:13,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:13,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:13,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:13,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:13,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:13,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:45:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:13,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:45:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:13,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:45:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:13,590 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-14 04:45:13,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:13,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741716047] [2022-07-14 04:45:13,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741716047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:13,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:13,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:13,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78288626] [2022-07-14 04:45:13,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:13,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:13,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:13,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:13,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:13,592 INFO L87 Difference]: Start difference. First operand 3114 states and 4161 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-14 04:45:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:17,281 INFO L93 Difference]: Finished difference Result 3114 states and 4161 transitions. [2022-07-14 04:45:17,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:17,281 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-14 04:45:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:17,292 INFO L225 Difference]: With dead ends: 3114 [2022-07-14 04:45:17,292 INFO L226 Difference]: Without dead ends: 3112 [2022-07-14 04:45:17,294 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-14 04:45:17,294 INFO L413 NwaCegarLoop]: 2171 mSDtfsCounter, 4151 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2573 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4282 SdHoareTripleChecker+Valid, 3375 SdHoareTripleChecker+Invalid, 4685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:17,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4282 Valid, 3375 Invalid, 4685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2573 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-14 04:45:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2022-07-14 04:45:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 3112. [2022-07-14 04:45:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3112 states, 2159 states have (on average 1.238073182028717) internal successors, (2673), 2243 states have internal predecessors, (2673), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:45:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4159 transitions. [2022-07-14 04:45:17,428 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4159 transitions. Word has length 106 [2022-07-14 04:45:17,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:17,428 INFO L495 AbstractCegarLoop]: Abstraction has 3112 states and 4159 transitions. [2022-07-14 04:45:17,428 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-14 04:45:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4159 transitions. [2022-07-14 04:45:17,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-14 04:45:17,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:17,430 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-14 04:45:17,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 04:45:17,430 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 27 more)] === [2022-07-14 04:45:17,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:17,431 INFO L85 PathProgramCache]: Analyzing trace with hash -711355629, now seen corresponding path program 1 times [2022-07-14 04:45:17,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:17,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72566080] [2022-07-14 04:45:17,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:17,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:17,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:17,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:17,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:17,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:17,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:17,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:17,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:17,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:17,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:17,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:17,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:17,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:17,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:17,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:45:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:17,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:45:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:17,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:45:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:17,605 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-14 04:45:17,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:17,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72566080] [2022-07-14 04:45:17,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72566080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:17,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:17,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:17,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476379706] [2022-07-14 04:45:17,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:17,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:17,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:17,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:17,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:17,607 INFO L87 Difference]: Start difference. First operand 3112 states and 4159 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-14 04:45:20,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:20,968 INFO L93 Difference]: Finished difference Result 3112 states and 4159 transitions. [2022-07-14 04:45:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:20,968 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-14 04:45:20,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:20,978 INFO L225 Difference]: With dead ends: 3112 [2022-07-14 04:45:20,978 INFO L226 Difference]: Without dead ends: 3110 [2022-07-14 04:45:20,979 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-14 04:45:20,980 INFO L413 NwaCegarLoop]: 2169 mSDtfsCounter, 4139 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4270 SdHoareTripleChecker+Valid, 3373 SdHoareTripleChecker+Invalid, 4687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:20,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4270 Valid, 3373 Invalid, 4687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-14 04:45:20,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2022-07-14 04:45:21,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 3110. [2022-07-14 04:45:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3110 states, 2158 states have (on average 1.2377201112140872) internal successors, (2671), 2241 states have internal predecessors, (2671), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:45:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 4157 transitions. [2022-07-14 04:45:21,083 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 4157 transitions. Word has length 108 [2022-07-14 04:45:21,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:21,084 INFO L495 AbstractCegarLoop]: Abstraction has 3110 states and 4157 transitions. [2022-07-14 04:45:21,085 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-14 04:45:21,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 4157 transitions. [2022-07-14 04:45:21,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-14 04:45:21,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:45:21,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 04:45:21,086 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 27 more)] === [2022-07-14 04:45:21,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:21,087 INFO L85 PathProgramCache]: Analyzing trace with hash -372751528, now seen corresponding path program 1 times [2022-07-14 04:45:21,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:21,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799916853] [2022-07-14 04:45:21,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:21,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:45:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:45:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:45:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:45:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:21,244 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-14 04:45:21,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:21,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799916853] [2022-07-14 04:45:21,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799916853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:21,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:21,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:21,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991769279] [2022-07-14 04:45:21,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:21,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:21,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:21,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:21,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:21,246 INFO L87 Difference]: Start difference. First operand 3110 states and 4157 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-14 04:45:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:24,729 INFO L93 Difference]: Finished difference Result 3110 states and 4157 transitions. [2022-07-14 04:45:24,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:24,730 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-14 04:45:24,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:24,741 INFO L225 Difference]: With dead ends: 3110 [2022-07-14 04:45:24,741 INFO L226 Difference]: Without dead ends: 3108 [2022-07-14 04:45:24,742 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-14 04:45:24,743 INFO L413 NwaCegarLoop]: 2167 mSDtfsCounter, 4135 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2573 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4265 SdHoareTripleChecker+Valid, 3371 SdHoareTripleChecker+Invalid, 4685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:24,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4265 Valid, 3371 Invalid, 4685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2573 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-14 04:45:24,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2022-07-14 04:45:24,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 3108. [2022-07-14 04:45:24,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3108 states, 2157 states have (on average 1.237366713027353) internal successors, (2669), 2239 states have internal predecessors, (2669), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:45:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 4155 transitions. [2022-07-14 04:45:24,852 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 4155 transitions. Word has length 114 [2022-07-14 04:45:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:24,853 INFO L495 AbstractCegarLoop]: Abstraction has 3108 states and 4155 transitions. [2022-07-14 04:45:24,853 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-14 04:45:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 4155 transitions. [2022-07-14 04:45:24,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-14 04:45:24,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:24,855 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-14 04:45:24,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 04:45:24,855 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 27 more)] === [2022-07-14 04:45:24,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:24,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1629281415, now seen corresponding path program 1 times [2022-07-14 04:45:24,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:24,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330914986] [2022-07-14 04:45:24,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:24,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:24,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:24,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:24,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:24,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:24,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:24,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:24,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:24,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:24,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:24,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:25,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:25,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:25,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:25,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:45:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:25,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:45:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:25,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:45:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:25,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:45:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:25,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:45:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:25,049 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-14 04:45:25,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:25,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330914986] [2022-07-14 04:45:25,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330914986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:25,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:25,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:25,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106245001] [2022-07-14 04:45:25,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:25,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:25,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:25,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:25,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:25,052 INFO L87 Difference]: Start difference. First operand 3108 states and 4155 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-14 04:45:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:28,488 INFO L93 Difference]: Finished difference Result 3108 states and 4155 transitions. [2022-07-14 04:45:28,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:28,488 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-14 04:45:28,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:28,498 INFO L225 Difference]: With dead ends: 3108 [2022-07-14 04:45:28,498 INFO L226 Difference]: Without dead ends: 3106 [2022-07-14 04:45:28,499 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-14 04:45:28,500 INFO L413 NwaCegarLoop]: 2165 mSDtfsCounter, 4129 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4258 SdHoareTripleChecker+Valid, 3369 SdHoareTripleChecker+Invalid, 4683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:28,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4258 Valid, 3369 Invalid, 4683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2571 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-14 04:45:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2022-07-14 04:45:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3106. [2022-07-14 04:45:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 2156 states have (on average 1.2370129870129871) internal successors, (2667), 2237 states have internal predecessors, (2667), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:45:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 4153 transitions. [2022-07-14 04:45:28,617 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 4153 transitions. Word has length 120 [2022-07-14 04:45:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:28,617 INFO L495 AbstractCegarLoop]: Abstraction has 3106 states and 4153 transitions. [2022-07-14 04:45:28,617 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-14 04:45:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 4153 transitions. [2022-07-14 04:45:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-14 04:45:28,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:28,619 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-14 04:45:28,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 04:45:28,619 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 27 more)] === [2022-07-14 04:45:28,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:28,620 INFO L85 PathProgramCache]: Analyzing trace with hash 408849737, now seen corresponding path program 1 times [2022-07-14 04:45:28,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:28,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043368327] [2022-07-14 04:45:28,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:28,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:45:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:45:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:45:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:45:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:45:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:45:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:28,820 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-14 04:45:28,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:28,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043368327] [2022-07-14 04:45:28,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043368327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:28,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:28,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:28,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586157865] [2022-07-14 04:45:28,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:28,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:28,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:28,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:28,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:28,822 INFO L87 Difference]: Start difference. First operand 3106 states and 4153 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-14 04:45:32,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:32,204 INFO L93 Difference]: Finished difference Result 3106 states and 4153 transitions. [2022-07-14 04:45:32,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:32,205 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-14 04:45:32,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:32,214 INFO L225 Difference]: With dead ends: 3106 [2022-07-14 04:45:32,214 INFO L226 Difference]: Without dead ends: 3104 [2022-07-14 04:45:32,215 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-14 04:45:32,215 INFO L413 NwaCegarLoop]: 2163 mSDtfsCounter, 4123 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2569 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4251 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 4681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:32,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4251 Valid, 3367 Invalid, 4681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2569 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-14 04:45:32,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3104 states. [2022-07-14 04:45:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3104 to 3104. [2022-07-14 04:45:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3104 states, 2155 states have (on average 1.2366589327146171) internal successors, (2665), 2235 states have internal predecessors, (2665), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:45:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 4151 transitions. [2022-07-14 04:45:32,326 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 4151 transitions. Word has length 126 [2022-07-14 04:45:32,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:32,327 INFO L495 AbstractCegarLoop]: Abstraction has 3104 states and 4151 transitions. [2022-07-14 04:45:32,327 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-14 04:45:32,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 4151 transitions. [2022-07-14 04:45:32,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-14 04:45:32,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:32,329 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-14 04:45:32,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 04:45:32,329 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 27 more)] === [2022-07-14 04:45:32,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:32,329 INFO L85 PathProgramCache]: Analyzing trace with hash -753274789, now seen corresponding path program 1 times [2022-07-14 04:45:32,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:32,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274942268] [2022-07-14 04:45:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:32,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:45:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:45:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:45:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:45:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:45:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:45:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:45:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,525 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-14 04:45:32,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:32,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274942268] [2022-07-14 04:45:32,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274942268] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:32,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:32,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:32,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230754595] [2022-07-14 04:45:32,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:32,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:32,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:32,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:32,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:32,528 INFO L87 Difference]: Start difference. First operand 3104 states and 4151 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-14 04:45:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:35,981 INFO L93 Difference]: Finished difference Result 3104 states and 4151 transitions. [2022-07-14 04:45:35,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:35,981 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-14 04:45:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:35,990 INFO L225 Difference]: With dead ends: 3104 [2022-07-14 04:45:35,991 INFO L226 Difference]: Without dead ends: 3102 [2022-07-14 04:45:35,992 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-14 04:45:35,993 INFO L413 NwaCegarLoop]: 2161 mSDtfsCounter, 4117 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4244 SdHoareTripleChecker+Valid, 3365 SdHoareTripleChecker+Invalid, 4679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:35,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4244 Valid, 3365 Invalid, 4679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2567 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-14 04:45:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2022-07-14 04:45:36,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 3102. [2022-07-14 04:45:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3102 states, 2154 states have (on average 1.2363045496750231) internal successors, (2663), 2233 states have internal predecessors, (2663), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:45:36,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 4149 transitions. [2022-07-14 04:45:36,134 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 4149 transitions. Word has length 132 [2022-07-14 04:45:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:36,135 INFO L495 AbstractCegarLoop]: Abstraction has 3102 states and 4149 transitions. [2022-07-14 04:45:36,135 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-14 04:45:36,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 4149 transitions. [2022-07-14 04:45:36,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-14 04:45:36,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:36,137 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-14 04:45:36,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 04:45:36,138 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 27 more)] === [2022-07-14 04:45:36,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:36,138 INFO L85 PathProgramCache]: Analyzing trace with hash -499223925, now seen corresponding path program 1 times [2022-07-14 04:45:36,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:36,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042836484] [2022-07-14 04:45:36,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:36,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:45:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:45:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:45:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:45:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:45:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:45:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:45:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:45:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,393 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-14 04:45:36,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:36,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042836484] [2022-07-14 04:45:36,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042836484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:36,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:36,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:36,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963003763] [2022-07-14 04:45:36,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:36,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:36,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:36,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:36,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:36,395 INFO L87 Difference]: Start difference. First operand 3102 states and 4149 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-14 04:45:40,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:40,511 INFO L93 Difference]: Finished difference Result 3102 states and 4149 transitions. [2022-07-14 04:45:40,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:40,511 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-14 04:45:40,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:40,537 INFO L225 Difference]: With dead ends: 3102 [2022-07-14 04:45:40,538 INFO L226 Difference]: Without dead ends: 3100 [2022-07-14 04:45:40,540 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-14 04:45:40,541 INFO L413 NwaCegarLoop]: 2159 mSDtfsCounter, 4111 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2565 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4237 SdHoareTripleChecker+Valid, 3363 SdHoareTripleChecker+Invalid, 4677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:40,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4237 Valid, 3363 Invalid, 4677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2565 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-14 04:45:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2022-07-14 04:45:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3100. [2022-07-14 04:45:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 2153 states have (on average 1.2359498374361357) internal successors, (2661), 2231 states have internal predecessors, (2661), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:45:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4147 transitions. [2022-07-14 04:45:40,680 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4147 transitions. Word has length 138 [2022-07-14 04:45:40,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:40,681 INFO L495 AbstractCegarLoop]: Abstraction has 3100 states and 4147 transitions. [2022-07-14 04:45:40,681 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-14 04:45:40,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4147 transitions. [2022-07-14 04:45:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-14 04:45:40,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:40,685 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-14 04:45:40,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 04:45:40,685 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 27 more)] === [2022-07-14 04:45:40,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:40,686 INFO L85 PathProgramCache]: Analyzing trace with hash -867666618, now seen corresponding path program 1 times [2022-07-14 04:45:40,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:40,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776208929] [2022-07-14 04:45:40,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:40,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:45:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:45:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:45:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:45:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:45:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:45:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:45:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:45:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:45:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:40,979 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-14 04:45:40,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:40,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776208929] [2022-07-14 04:45:40,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776208929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:40,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:40,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:40,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947582900] [2022-07-14 04:45:40,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:40,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:40,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:40,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:40,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:40,982 INFO L87 Difference]: Start difference. First operand 3100 states and 4147 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-14 04:45:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:44,667 INFO L93 Difference]: Finished difference Result 3100 states and 4147 transitions. [2022-07-14 04:45:44,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:44,668 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-14 04:45:44,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:44,678 INFO L225 Difference]: With dead ends: 3100 [2022-07-14 04:45:44,679 INFO L226 Difference]: Without dead ends: 3098 [2022-07-14 04:45:44,680 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-14 04:45:44,681 INFO L413 NwaCegarLoop]: 2157 mSDtfsCounter, 4105 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2563 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4230 SdHoareTripleChecker+Valid, 3361 SdHoareTripleChecker+Invalid, 4675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:44,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4230 Valid, 3361 Invalid, 4675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2563 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-14 04:45:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2022-07-14 04:45:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 3098. [2022-07-14 04:45:44,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 2152 states have (on average 1.2355947955390334) internal successors, (2659), 2229 states have internal predecessors, (2659), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:45:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4145 transitions. [2022-07-14 04:45:44,863 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4145 transitions. Word has length 144 [2022-07-14 04:45:44,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:44,863 INFO L495 AbstractCegarLoop]: Abstraction has 3098 states and 4145 transitions. [2022-07-14 04:45:44,863 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-14 04:45:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4145 transitions. [2022-07-14 04:45:44,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-14 04:45:44,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:44,866 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-14 04:45:44,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 04:45:44,867 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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 27 more)] === [2022-07-14 04:45:44,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:44,867 INFO L85 PathProgramCache]: Analyzing trace with hash -312577598, now seen corresponding path program 1 times [2022-07-14 04:45:44,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:44,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026490017] [2022-07-14 04:45:44,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:44,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:44,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:44,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:44,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:44,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:44,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:44,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:45:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:45:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:45:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:45:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:45:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:45:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:45:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:45:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:45:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:45:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:45,094 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-14 04:45:45,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:45,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026490017] [2022-07-14 04:45:45,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026490017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:45,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:45,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:45,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794156371] [2022-07-14 04:45:45,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:45,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:45,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:45,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:45,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:45,097 INFO L87 Difference]: Start difference. First operand 3098 states and 4145 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-14 04:45:48,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:48,505 INFO L93 Difference]: Finished difference Result 3098 states and 4145 transitions. [2022-07-14 04:45:48,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:48,505 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-14 04:45:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:48,523 INFO L225 Difference]: With dead ends: 3098 [2022-07-14 04:45:48,523 INFO L226 Difference]: Without dead ends: 3096 [2022-07-14 04:45:48,524 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-14 04:45:48,525 INFO L413 NwaCegarLoop]: 2155 mSDtfsCounter, 4099 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2561 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4223 SdHoareTripleChecker+Valid, 3359 SdHoareTripleChecker+Invalid, 4673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:48,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4223 Valid, 3359 Invalid, 4673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2561 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-14 04:45:48,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2022-07-14 04:45:48,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 3096. [2022-07-14 04:45:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3096 states, 2151 states have (on average 1.2352394235239423) internal successors, (2657), 2227 states have internal predecessors, (2657), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:45:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 4143 transitions. [2022-07-14 04:45:48,681 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 4143 transitions. Word has length 150 [2022-07-14 04:45:48,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:48,682 INFO L495 AbstractCegarLoop]: Abstraction has 3096 states and 4143 transitions. [2022-07-14 04:45:48,682 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-14 04:45:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 4143 transitions. [2022-07-14 04:45:48,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-14 04:45:48,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:48,684 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-14 04:45:48,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 04:45:48,684 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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 27 more)] === [2022-07-14 04:45:48,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:48,685 INFO L85 PathProgramCache]: Analyzing trace with hash 135128004, now seen corresponding path program 1 times [2022-07-14 04:45:48,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:48,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508313597] [2022-07-14 04:45:48,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:48,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:45:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:45:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:45:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:45:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:45:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:45:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:45:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:45:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:45:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:45:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:45:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,881 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-14 04:45:48,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:48,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508313597] [2022-07-14 04:45:48,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508313597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:48,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:48,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:48,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766989801] [2022-07-14 04:45:48,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:48,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:48,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:48,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:48,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:48,884 INFO L87 Difference]: Start difference. First operand 3096 states and 4143 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-14 04:45:52,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:52,317 INFO L93 Difference]: Finished difference Result 3096 states and 4143 transitions. [2022-07-14 04:45:52,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:52,317 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-14 04:45:52,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:52,326 INFO L225 Difference]: With dead ends: 3096 [2022-07-14 04:45:52,326 INFO L226 Difference]: Without dead ends: 3094 [2022-07-14 04:45:52,328 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-14 04:45:52,328 INFO L413 NwaCegarLoop]: 2153 mSDtfsCounter, 4093 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4216 SdHoareTripleChecker+Valid, 3357 SdHoareTripleChecker+Invalid, 4671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:52,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4216 Valid, 3357 Invalid, 4671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-14 04:45:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2022-07-14 04:45:52,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3094. [2022-07-14 04:45:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3094 states, 2150 states have (on average 1.2348837209302326) internal successors, (2655), 2225 states have internal predecessors, (2655), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:45:52,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 4141 transitions. [2022-07-14 04:45:52,467 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 4141 transitions. Word has length 156 [2022-07-14 04:45:52,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:52,468 INFO L495 AbstractCegarLoop]: Abstraction has 3094 states and 4141 transitions. [2022-07-14 04:45:52,468 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-14 04:45:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 4141 transitions. [2022-07-14 04:45:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-14 04:45:52,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:52,470 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-14 04:45:52,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 04:45:52,471 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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 27 more)] === [2022-07-14 04:45:52,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:52,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1099415850, now seen corresponding path program 1 times [2022-07-14 04:45:52,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:52,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809107067] [2022-07-14 04:45:52,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:52,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:45:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:45:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:45:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:45:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:45:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:45:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:45:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:45:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:45:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:45:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:45:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:45:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:52,752 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-14 04:45:52,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:52,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809107067] [2022-07-14 04:45:52,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809107067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:52,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:52,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:52,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882707680] [2022-07-14 04:45:52,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:52,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:52,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:52,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:52,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:52,755 INFO L87 Difference]: Start difference. First operand 3094 states and 4141 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-14 04:45:57,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:57,115 INFO L93 Difference]: Finished difference Result 3094 states and 4141 transitions. [2022-07-14 04:45:57,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:57,116 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-14 04:45:57,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:57,127 INFO L225 Difference]: With dead ends: 3094 [2022-07-14 04:45:57,127 INFO L226 Difference]: Without dead ends: 3092 [2022-07-14 04:45:57,130 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-14 04:45:57,131 INFO L413 NwaCegarLoop]: 2151 mSDtfsCounter, 4087 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2557 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4209 SdHoareTripleChecker+Valid, 3355 SdHoareTripleChecker+Invalid, 4669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:57,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4209 Valid, 3355 Invalid, 4669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2557 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-14 04:45:57,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2022-07-14 04:45:57,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 3092. [2022-07-14 04:45:57,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3092 states, 2149 states have (on average 1.234527687296417) internal successors, (2653), 2223 states have internal predecessors, (2653), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:45:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4139 transitions. [2022-07-14 04:45:57,303 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4139 transitions. Word has length 162 [2022-07-14 04:45:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:57,304 INFO L495 AbstractCegarLoop]: Abstraction has 3092 states and 4139 transitions. [2022-07-14 04:45:57,304 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-14 04:45:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4139 transitions. [2022-07-14 04:45:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-07-14 04:45:57,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:57,307 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:45:57,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 04:45:57,308 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_assert_linux_kernel_locking_mutex__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 27 more)] === [2022-07-14 04:45:57,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:57,308 INFO L85 PathProgramCache]: Analyzing trace with hash -122245697, now seen corresponding path program 1 times [2022-07-14 04:45:57,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:57,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214329317] [2022-07-14 04:45:57,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:57,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:45:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:45:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:45:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:45:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:45:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:45:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:45:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:45:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:45:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:45:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:45:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:45:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:45:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 04:45:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 04:45:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-14 04:45:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 04:45:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 04:45:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:45:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-14 04:45:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-14 04:45:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2022-07-14 04:45:57,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:57,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214329317] [2022-07-14 04:45:57,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214329317] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:57,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:57,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:45:57,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850964108] [2022-07-14 04:45:57,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:57,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:45:57,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:57,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:45:57,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:45:57,728 INFO L87 Difference]: Start difference. First operand 3092 states and 4139 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-14 04:46:04,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:04,477 INFO L93 Difference]: Finished difference Result 3241 states and 4371 transitions. [2022-07-14 04:46:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 04:46:04,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 205 [2022-07-14 04:46:04,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:04,483 INFO L225 Difference]: With dead ends: 3241 [2022-07-14 04:46:04,483 INFO L226 Difference]: Without dead ends: 3239 [2022-07-14 04:46:04,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-07-14 04:46:04,484 INFO L413 NwaCegarLoop]: 2143 mSDtfsCounter, 5025 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 5364 mSolverCounterSat, 2905 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5149 SdHoareTripleChecker+Valid, 4204 SdHoareTripleChecker+Invalid, 8269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2905 IncrementalHoareTripleChecker+Valid, 5364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:04,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5149 Valid, 4204 Invalid, 8269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2905 Valid, 5364 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-07-14 04:46:04,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2022-07-14 04:46:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 3090. [2022-07-14 04:46:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3090 states, 2148 states have (on average 1.233705772811918) internal successors, (2650), 2221 states have internal predecessors, (2650), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:46:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 4136 transitions. [2022-07-14 04:46:04,628 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 4136 transitions. Word has length 205 [2022-07-14 04:46:04,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:04,628 INFO L495 AbstractCegarLoop]: Abstraction has 3090 states and 4136 transitions. [2022-07-14 04:46:04,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-14 04:46:04,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 4136 transitions. [2022-07-14 04:46:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-14 04:46:04,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:04,631 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-14 04:46:04,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 04:46:04,631 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 27 more)] === [2022-07-14 04:46:04,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:04,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1437092455, now seen corresponding path program 1 times [2022-07-14 04:46:04,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:04,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208796093] [2022-07-14 04:46:04,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:04,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:46:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:46:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:46:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:46:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:46:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:46:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:46:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:46:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:46:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:46:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:46:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:46:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:46:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:46:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:46:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:46:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:46:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:46:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:46:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:46:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:04,819 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-14 04:46:04,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:04,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208796093] [2022-07-14 04:46:04,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208796093] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:04,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:04,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:46:04,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303688629] [2022-07-14 04:46:04,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:04,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:46:04,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:04,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:46:04,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:46:04,822 INFO L87 Difference]: Start difference. First operand 3090 states and 4136 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-14 04:46:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:08,276 INFO L93 Difference]: Finished difference Result 3090 states and 4136 transitions. [2022-07-14 04:46:08,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:46:08,276 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-14 04:46:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:08,283 INFO L225 Difference]: With dead ends: 3090 [2022-07-14 04:46:08,284 INFO L226 Difference]: Without dead ends: 3088 [2022-07-14 04:46:08,284 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-14 04:46:08,285 INFO L413 NwaCegarLoop]: 2147 mSDtfsCounter, 4075 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2553 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4196 SdHoareTripleChecker+Valid, 3351 SdHoareTripleChecker+Invalid, 4665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:08,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4196 Valid, 3351 Invalid, 4665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2553 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-14 04:46:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2022-07-14 04:46:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 3088. [2022-07-14 04:46:08,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3088 states, 2147 states have (on average 1.2333488588728458) internal successors, (2648), 2219 states have internal predecessors, (2648), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:46:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 4134 transitions. [2022-07-14 04:46:08,456 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 4134 transitions. Word has length 168 [2022-07-14 04:46:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:08,456 INFO L495 AbstractCegarLoop]: Abstraction has 3088 states and 4134 transitions. [2022-07-14 04:46:08,456 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-14 04:46:08,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 4134 transitions. [2022-07-14 04:46:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-14 04:46:08,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:08,458 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-14 04:46:08,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 04:46:08,459 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 27 more)] === [2022-07-14 04:46:08,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:08,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1470050927, now seen corresponding path program 1 times [2022-07-14 04:46:08,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:08,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318175340] [2022-07-14 04:46:08,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:08,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:46:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:46:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:46:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:46:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:46:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:46:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:46:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:46:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:46:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:46:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:46:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:46:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:46:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:46:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:46:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:46:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:46:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:46:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:46:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:46:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-14 04:46:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:08,649 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-14 04:46:08,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:08,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318175340] [2022-07-14 04:46:08,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318175340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:08,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:08,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:46:08,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510959326] [2022-07-14 04:46:08,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:08,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:46:08,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:08,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:46:08,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:46:08,651 INFO L87 Difference]: Start difference. First operand 3088 states and 4134 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-14 04:46:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:11,976 INFO L93 Difference]: Finished difference Result 3088 states and 4134 transitions. [2022-07-14 04:46:11,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:46:11,977 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-14 04:46:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:11,983 INFO L225 Difference]: With dead ends: 3088 [2022-07-14 04:46:11,984 INFO L226 Difference]: Without dead ends: 3086 [2022-07-14 04:46:11,984 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-14 04:46:11,985 INFO L413 NwaCegarLoop]: 2145 mSDtfsCounter, 4069 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4189 SdHoareTripleChecker+Valid, 3349 SdHoareTripleChecker+Invalid, 4663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:11,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4189 Valid, 3349 Invalid, 4663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-14 04:46:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3086 states. [2022-07-14 04:46:12,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3086 to 3086. [2022-07-14 04:46:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 2146 states have (on average 1.232991612301957) internal successors, (2646), 2217 states have internal predecessors, (2646), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-14 04:46:12,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 4132 transitions. [2022-07-14 04:46:12,123 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 4132 transitions. Word has length 174 [2022-07-14 04:46:12,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:12,124 INFO L495 AbstractCegarLoop]: Abstraction has 3086 states and 4132 transitions. [2022-07-14 04:46:12,124 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-14 04:46:12,124 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 4132 transitions. [2022-07-14 04:46:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-14 04:46:12,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:12,126 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, 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] [2022-07-14 04:46:12,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 04:46:12,127 INFO L420 AbstractCegarLoop]: === Iteration 24 === 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 27 more)] === [2022-07-14 04:46:12,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:12,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1645425594, now seen corresponding path program 1 times [2022-07-14 04:46:12,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:12,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097246586] [2022-07-14 04:46:12,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:12,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:46:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:46:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:46:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:46:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:46:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:46:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 04:46:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 04:46:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-14 04:46:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 04:46:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 04:46:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-14 04:46:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-14 04:46:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:46:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 04:46:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-07-14 04:46:12,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:12,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097246586] [2022-07-14 04:46:12,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097246586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:12,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:12,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 04:46:12,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733461186] [2022-07-14 04:46:12,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:12,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:46:12,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:12,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:46:12,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:46:12,406 INFO L87 Difference]: Start difference. First operand 3086 states and 4132 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (32), 7 states have call predecessors, (32), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-14 04:46:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:21,369 INFO L93 Difference]: Finished difference Result 4612 states and 6232 transitions. [2022-07-14 04:46:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 04:46:21,370 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (32), 7 states have call predecessors, (32), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 211 [2022-07-14 04:46:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:21,380 INFO L225 Difference]: With dead ends: 4612 [2022-07-14 04:46:21,381 INFO L226 Difference]: Without dead ends: 4610 [2022-07-14 04:46:21,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2022-07-14 04:46:21,382 INFO L413 NwaCegarLoop]: 2304 mSDtfsCounter, 7514 mSDsluCounter, 2415 mSDsCounter, 0 mSdLazyCounter, 7805 mSolverCounterSat, 4744 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7640 SdHoareTripleChecker+Valid, 4719 SdHoareTripleChecker+Invalid, 12549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4744 IncrementalHoareTripleChecker+Valid, 7805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:21,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7640 Valid, 4719 Invalid, 12549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4744 Valid, 7805 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-07-14 04:46:21,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2022-07-14 04:46:21,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 3955. [2022-07-14 04:46:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3955 states, 2749 states have (on average 1.2269916333212076) internal successors, (3373), 2825 states have internal predecessors, (3373), 938 states have call successors, (938), 263 states have call predecessors, (938), 262 states have return successors, (936), 931 states have call predecessors, (936), 936 states have call successors, (936) [2022-07-14 04:46:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3955 states to 3955 states and 5247 transitions. [2022-07-14 04:46:21,595 INFO L78 Accepts]: Start accepts. Automaton has 3955 states and 5247 transitions. Word has length 211 [2022-07-14 04:46:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:21,596 INFO L495 AbstractCegarLoop]: Abstraction has 3955 states and 5247 transitions. [2022-07-14 04:46:21,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (32), 7 states have call predecessors, (32), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-14 04:46:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3955 states and 5247 transitions. [2022-07-14 04:46:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-07-14 04:46:21,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:21,598 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:46:21,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 04:46:21,599 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_assert_linux_kernel_locking_mutex__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 27 more)] === [2022-07-14 04:46:21,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:21,599 INFO L85 PathProgramCache]: Analyzing trace with hash -464471811, now seen corresponding path program 1 times [2022-07-14 04:46:21,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:21,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193207663] [2022-07-14 04:46:21,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:21,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:46:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:46:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:46:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:46:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:46:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:46:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 04:46:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 04:46:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-14 04:46:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 04:46:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 04:46:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:46:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-14 04:46:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-14 04:46:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-14 04:46:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2022-07-14 04:46:21,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:21,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193207663] [2022-07-14 04:46:21,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193207663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:21,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:21,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 04:46:21,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048825061] [2022-07-14 04:46:21,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:21,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:46:21,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:21,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:46:21,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:46:21,893 INFO L87 Difference]: Start difference. First operand 3955 states and 5247 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2022-07-14 04:46:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:30,278 INFO L93 Difference]: Finished difference Result 4157 states and 5549 transitions. [2022-07-14 04:46:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 04:46:30,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) Word has length 217 [2022-07-14 04:46:30,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:30,288 INFO L225 Difference]: With dead ends: 4157 [2022-07-14 04:46:30,288 INFO L226 Difference]: Without dead ends: 4155 [2022-07-14 04:46:30,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-07-14 04:46:30,289 INFO L413 NwaCegarLoop]: 2136 mSDtfsCounter, 4567 mSDsluCounter, 2895 mSDsCounter, 0 mSdLazyCounter, 7448 mSolverCounterSat, 3049 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4567 SdHoareTripleChecker+Valid, 5031 SdHoareTripleChecker+Invalid, 10497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3049 IncrementalHoareTripleChecker+Valid, 7448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:30,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4567 Valid, 5031 Invalid, 10497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3049 Valid, 7448 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-07-14 04:46:30,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2022-07-14 04:46:30,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 3953. [2022-07-14 04:46:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3953 states, 2748 states have (on average 1.2263464337700145) internal successors, (3370), 2823 states have internal predecessors, (3370), 938 states have call successors, (938), 263 states have call predecessors, (938), 262 states have return successors, (936), 931 states have call predecessors, (936), 936 states have call successors, (936) [2022-07-14 04:46:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 5244 transitions. [2022-07-14 04:46:30,495 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 5244 transitions. Word has length 217 [2022-07-14 04:46:30,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:30,496 INFO L495 AbstractCegarLoop]: Abstraction has 3953 states and 5244 transitions. [2022-07-14 04:46:30,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2022-07-14 04:46:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 5244 transitions. [2022-07-14 04:46:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-14 04:46:30,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:30,498 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-14 04:46:30,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-14 04:46:30,498 INFO L420 AbstractCegarLoop]: === Iteration 26 === 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 27 more)] === [2022-07-14 04:46:30,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:30,499 INFO L85 PathProgramCache]: Analyzing trace with hash -965782681, now seen corresponding path program 1 times [2022-07-14 04:46:30,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:30,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220162044] [2022-07-14 04:46:30,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:30,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:46:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:46:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:46:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:46:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:46:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:46:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:46:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:46:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:46:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:46:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:46:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:46:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:46:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:46:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:46:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:46:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:46:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:46:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:46:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:46:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-14 04:46:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-14 04:46:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,716 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-14 04:46:30,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:30,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220162044] [2022-07-14 04:46:30,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220162044] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:30,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:30,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:46:30,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271683978] [2022-07-14 04:46:30,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:30,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:46:30,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:30,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:46:30,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:46:30,719 INFO L87 Difference]: Start difference. First operand 3953 states and 5244 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-14 04:46:34,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:34,000 INFO L93 Difference]: Finished difference Result 3953 states and 5244 transitions. [2022-07-14 04:46:34,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:46:34,001 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-14 04:46:34,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:34,008 INFO L225 Difference]: With dead ends: 3953 [2022-07-14 04:46:34,008 INFO L226 Difference]: Without dead ends: 3760 [2022-07-14 04:46:34,010 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-14 04:46:34,010 INFO L413 NwaCegarLoop]: 2140 mSDtfsCounter, 4048 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4167 SdHoareTripleChecker+Valid, 3344 SdHoareTripleChecker+Invalid, 4659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:34,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4167 Valid, 3344 Invalid, 4659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2547 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-14 04:46:34,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2022-07-14 04:46:34,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 3760. [2022-07-14 04:46:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3760 states, 2630 states have (on average 1.2342205323193916) internal successors, (3246), 2702 states have internal predecessors, (3246), 883 states have call successors, (883), 243 states have call predecessors, (883), 243 states have return successors, (883), 878 states have call predecessors, (883), 883 states have call successors, (883) [2022-07-14 04:46:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3760 states and 5012 transitions. [2022-07-14 04:46:34,213 INFO L78 Accepts]: Start accepts. Automaton has 3760 states and 5012 transitions. Word has length 180 [2022-07-14 04:46:34,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:34,214 INFO L495 AbstractCegarLoop]: Abstraction has 3760 states and 5012 transitions. [2022-07-14 04:46:34,214 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-14 04:46:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 5012 transitions. [2022-07-14 04:46:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-07-14 04:46:34,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:34,216 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 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] [2022-07-14 04:46:34,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-14 04:46:34,216 INFO L420 AbstractCegarLoop]: === Iteration 27 === 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 27 more)] === [2022-07-14 04:46:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:34,217 INFO L85 PathProgramCache]: Analyzing trace with hash 862312457, now seen corresponding path program 1 times [2022-07-14 04:46:34,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:34,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645770462] [2022-07-14 04:46:34,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:34,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:46:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:46:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:46:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:46:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:46:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:46:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 04:46:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 04:46:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-14 04:46:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 04:46:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 04:46:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:46:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:46:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 04:46:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-14 04:46:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-14 04:46:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-14 04:46:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,484 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-07-14 04:46:34,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:34,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645770462] [2022-07-14 04:46:34,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645770462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:34,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:34,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:46:34,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698643158] [2022-07-14 04:46:34,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:34,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:46:34,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:34,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:46:34,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:46:34,486 INFO L87 Difference]: Start difference. First operand 3760 states and 5012 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (34), 6 states have call predecessors, (34), 2 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-14 04:46:41,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:41,313 INFO L93 Difference]: Finished difference Result 8820 states and 11982 transitions. [2022-07-14 04:46:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 04:46:41,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (34), 6 states have call predecessors, (34), 2 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 227 [2022-07-14 04:46:41,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:41,330 INFO L225 Difference]: With dead ends: 8820 [2022-07-14 04:46:41,331 INFO L226 Difference]: Without dead ends: 5079 [2022-07-14 04:46:41,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2022-07-14 04:46:41,343 INFO L413 NwaCegarLoop]: 1933 mSDtfsCounter, 5363 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 3806 mSolverCounterSat, 3477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5363 SdHoareTripleChecker+Valid, 3567 SdHoareTripleChecker+Invalid, 7283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3477 IncrementalHoareTripleChecker+Valid, 3806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:41,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5363 Valid, 3567 Invalid, 7283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3477 Valid, 3806 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-14 04:46:41,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5079 states. [2022-07-14 04:46:41,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5079 to 3784. [2022-07-14 04:46:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3784 states, 2646 states have (on average 1.2343159486016628) internal successors, (3266), 2714 states have internal predecessors, (3266), 891 states have call successors, (891), 243 states have call predecessors, (891), 243 states have return successors, (891), 886 states have call predecessors, (891), 891 states have call successors, (891) [2022-07-14 04:46:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5048 transitions. [2022-07-14 04:46:41,582 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5048 transitions. Word has length 227 [2022-07-14 04:46:41,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:41,583 INFO L495 AbstractCegarLoop]: Abstraction has 3784 states and 5048 transitions. [2022-07-14 04:46:41,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (34), 6 states have call predecessors, (34), 2 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-14 04:46:41,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5048 transitions. [2022-07-14 04:46:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-07-14 04:46:41,585 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:41,586 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:46:41,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 04:46:41,586 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 27 more)] === [2022-07-14 04:46:41,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:41,586 INFO L85 PathProgramCache]: Analyzing trace with hash 125964688, now seen corresponding path program 1 times [2022-07-14 04:46:41,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:41,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492300654] [2022-07-14 04:46:41,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:41,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:46:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:46:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:46:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:46:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:46:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:46:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 04:46:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 04:46:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-14 04:46:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 04:46:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 04:46:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:46:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:46:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 04:46:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:46:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:46:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-14 04:46:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-14 04:46:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 04:46:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-07-14 04:46:41,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:41,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492300654] [2022-07-14 04:46:41,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492300654] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:46:41,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978401222] [2022-07-14 04:46:41,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:41,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:46:41,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:46:41,910 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-14 04:46:41,911 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-14 04:46:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:42,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 2521 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-14 04:46:42,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:46:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2022-07-14 04:46:42,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:46:42,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978401222] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:42,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:46:42,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [9] total 22 [2022-07-14 04:46:42,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711434088] [2022-07-14 04:46:42,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:42,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 04:46:42,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:42,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 04:46:42,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2022-07-14 04:46:42,825 INFO L87 Difference]: Start difference. First operand 3784 states and 5048 transitions. Second operand has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 6 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2022-07-14 04:46:43,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:43,915 INFO L93 Difference]: Finished difference Result 8040 states and 10767 transitions. [2022-07-14 04:46:43,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 04:46:43,915 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 6 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) Word has length 239 [2022-07-14 04:46:43,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:43,933 INFO L225 Difference]: With dead ends: 8040 [2022-07-14 04:46:43,934 INFO L226 Difference]: Without dead ends: 4274 [2022-07-14 04:46:43,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2022-07-14 04:46:43,946 INFO L413 NwaCegarLoop]: 2609 mSDtfsCounter, 1381 mSDsluCounter, 32051 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 34660 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:43,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 34660 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 04:46:43,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4274 states. [2022-07-14 04:46:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4274 to 3812. [2022-07-14 04:46:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3812 states, 2666 states have (on average 1.2333083270817704) internal successors, (3288), 2734 states have internal predecessors, (3288), 899 states have call successors, (899), 243 states have call predecessors, (899), 243 states have return successors, (899), 893 states have call predecessors, (899), 899 states have call successors, (899) [2022-07-14 04:46:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3812 states to 3812 states and 5086 transitions. [2022-07-14 04:46:44,315 INFO L78 Accepts]: Start accepts. Automaton has 3812 states and 5086 transitions. Word has length 239 [2022-07-14 04:46:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:44,316 INFO L495 AbstractCegarLoop]: Abstraction has 3812 states and 5086 transitions. [2022-07-14 04:46:44,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 6 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2022-07-14 04:46:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3812 states and 5086 transitions. [2022-07-14 04:46:44,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2022-07-14 04:46:44,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:44,319 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:46:44,355 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-14 04:46:44,535 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,SelfDestructingSolverStorable27 [2022-07-14 04:46:44,536 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 27 more)] === [2022-07-14 04:46:44,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:44,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1053085854, now seen corresponding path program 1 times [2022-07-14 04:46:44,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:44,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589511438] [2022-07-14 04:46:44,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:44,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:46:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:46:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:46:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:46:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:46:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 04:46:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:46:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 04:46:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-14 04:46:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 04:46:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:46:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-14 04:46:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-14 04:46:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-14 04:46:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-14 04:46:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-14 04:46:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-14 04:46:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-14 04:46:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-14 04:46:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-14 04:46:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:46:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 04:46:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:46:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:46:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-14 04:46:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-14 04:46:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-07-14 04:46:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2022-07-14 04:46:44,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:44,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589511438] [2022-07-14 04:46:44,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589511438] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:44,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:44,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 04:46:44,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166771326] [2022-07-14 04:46:44,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:44,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 04:46:44,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:44,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 04:46:44,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:46:44,966 INFO L87 Difference]: Start difference. First operand 3812 states and 5086 transitions. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (44), 7 states have call predecessors, (44), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-14 04:46:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:54,851 INFO L93 Difference]: Finished difference Result 8328 states and 11225 transitions. [2022-07-14 04:46:54,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 04:46:54,852 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (44), 7 states have call predecessors, (44), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 304 [2022-07-14 04:46:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:54,865 INFO L225 Difference]: With dead ends: 8328 [2022-07-14 04:46:54,865 INFO L226 Difference]: Without dead ends: 4535 [2022-07-14 04:46:54,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2022-07-14 04:46:54,873 INFO L413 NwaCegarLoop]: 1981 mSDtfsCounter, 5513 mSDsluCounter, 2607 mSDsCounter, 0 mSdLazyCounter, 7571 mSolverCounterSat, 3983 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5515 SdHoareTripleChecker+Valid, 4588 SdHoareTripleChecker+Invalid, 11554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3983 IncrementalHoareTripleChecker+Valid, 7571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:54,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5515 Valid, 4588 Invalid, 11554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3983 Valid, 7571 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2022-07-14 04:46:54,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2022-07-14 04:46:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 3815. [2022-07-14 04:46:55,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3815 states, 2669 states have (on average 1.2330460846759086) internal successors, (3291), 2737 states have internal predecessors, (3291), 899 states have call successors, (899), 243 states have call predecessors, (899), 243 states have return successors, (899), 893 states have call predecessors, (899), 899 states have call successors, (899) [2022-07-14 04:46:55,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 5089 transitions. [2022-07-14 04:46:55,115 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 5089 transitions. Word has length 304 [2022-07-14 04:46:55,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:55,115 INFO L495 AbstractCegarLoop]: Abstraction has 3815 states and 5089 transitions. [2022-07-14 04:46:55,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (44), 7 states have call predecessors, (44), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-14 04:46:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 5089 transitions. [2022-07-14 04:46:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-07-14 04:46:55,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:55,118 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:46:55,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-14 04:46:55,118 INFO L420 AbstractCegarLoop]: === Iteration 30 === 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 27 more)] === [2022-07-14 04:46:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:55,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1459983746, now seen corresponding path program 1 times [2022-07-14 04:46:55,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:55,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608341841] [2022-07-14 04:46:55,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:55,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:46:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:46:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:46:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:46:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:46:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 04:46:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:46:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 04:46:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-14 04:46:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 04:46:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-14 04:46:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-14 04:46:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-14 04:46:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-14 04:46:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:46:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:46:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-14 04:46:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:46:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:46:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 04:46:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-14 04:46:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:46:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 04:46:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:46:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:46:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-07-14 04:46:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-07-14 04:46:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2022-07-14 04:46:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:55,632 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2022-07-14 04:46:55,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:55,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608341841] [2022-07-14 04:46:55,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608341841] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:46:55,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046032465] [2022-07-14 04:46:55,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:55,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:46:55,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:46:55,656 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-14 04:46:55,658 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-14 04:46:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:56,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 3079 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-14 04:46:56,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:46:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-07-14 04:46:56,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:46:56,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046032465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:56,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:46:56,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [10] total 23 [2022-07-14 04:46:56,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193906342] [2022-07-14 04:46:56,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:56,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 04:46:56,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:56,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 04:46:56,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2022-07-14 04:46:56,696 INFO L87 Difference]: Start difference. First operand 3815 states and 5089 transitions. Second operand has 15 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 7 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (41), 7 states have call predecessors, (41), 7 states have call successors, (41) [2022-07-14 04:46:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:57,774 INFO L93 Difference]: Finished difference Result 8541 states and 11471 transitions. [2022-07-14 04:46:57,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 04:46:57,774 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 7 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (41), 7 states have call predecessors, (41), 7 states have call successors, (41) Word has length 325 [2022-07-14 04:46:57,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:57,785 INFO L225 Difference]: With dead ends: 8541 [2022-07-14 04:46:57,786 INFO L226 Difference]: Without dead ends: 4744 [2022-07-14 04:46:57,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=1278, Unknown=0, NotChecked=0, Total=1482 [2022-07-14 04:46:57,794 INFO L413 NwaCegarLoop]: 2662 mSDtfsCounter, 1387 mSDsluCounter, 32684 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1458 SdHoareTripleChecker+Valid, 35346 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:57,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1458 Valid, 35346 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 04:46:57,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2022-07-14 04:46:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 3810. [2022-07-14 04:46:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3810 states, 2667 states have (on average 1.2332208473940758) internal successors, (3289), 2735 states have internal predecessors, (3289), 896 states have call successors, (896), 243 states have call predecessors, (896), 243 states have return successors, (896), 890 states have call predecessors, (896), 896 states have call successors, (896) [2022-07-14 04:46:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3810 states to 3810 states and 5081 transitions. [2022-07-14 04:46:58,072 INFO L78 Accepts]: Start accepts. Automaton has 3810 states and 5081 transitions. Word has length 325 [2022-07-14 04:46:58,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:58,073 INFO L495 AbstractCegarLoop]: Abstraction has 3810 states and 5081 transitions. [2022-07-14 04:46:58,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 7 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (41), 7 states have call predecessors, (41), 7 states have call successors, (41) [2022-07-14 04:46:58,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3810 states and 5081 transitions. [2022-07-14 04:46:58,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2022-07-14 04:46:58,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:58,075 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-07-14 04:46:58,097 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-14 04:46:58,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:46:58,284 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 27 more)] === [2022-07-14 04:46:58,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:58,285 INFO L85 PathProgramCache]: Analyzing trace with hash -445733852, now seen corresponding path program 1 times [2022-07-14 04:46:58,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:58,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024127983] [2022-07-14 04:46:58,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:58,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:46:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:46:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:46:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:46:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:46:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 04:46:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:46:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 04:46:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-14 04:46:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 04:46:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-14 04:46:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:46:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:46:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-14 04:46:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-14 04:46:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:46:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 04:46:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:46:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:46:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-07-14 04:46:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-14 04:46:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-14 04:46:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:58,708 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-07-14 04:46:58,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:58,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024127983] [2022-07-14 04:46:58,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024127983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:58,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:58,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-14 04:46:58,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384721436] [2022-07-14 04:46:58,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:58,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 04:46:58,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:58,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 04:46:58,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-07-14 04:46:58,710 INFO L87 Difference]: Start difference. First operand 3810 states and 5081 transitions. Second operand has 15 states, 15 states have (on average 8.466666666666667) internal successors, (127), 11 states have internal predecessors, (127), 2 states have call successors, (35), 5 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-14 04:47:15,140 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:47:21,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:47:21,993 INFO L93 Difference]: Finished difference Result 6950 states and 9731 transitions. [2022-07-14 04:47:21,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-14 04:47:21,994 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.466666666666667) internal successors, (127), 11 states have internal predecessors, (127), 2 states have call successors, (35), 5 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 307 [2022-07-14 04:47:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:47:22,012 INFO L225 Difference]: With dead ends: 6950 [2022-07-14 04:47:22,012 INFO L226 Difference]: Without dead ends: 6948 [2022-07-14 04:47:22,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=872, Invalid=4678, Unknown=0, NotChecked=0, Total=5550 [2022-07-14 04:47:22,016 INFO L413 NwaCegarLoop]: 3466 mSDtfsCounter, 7274 mSDsluCounter, 14919 mSDsCounter, 0 mSdLazyCounter, 26659 mSolverCounterSat, 5345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7532 SdHoareTripleChecker+Valid, 18385 SdHoareTripleChecker+Invalid, 32004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5345 IncrementalHoareTripleChecker+Valid, 26659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:47:22,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7532 Valid, 18385 Invalid, 32004 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5345 Valid, 26659 Invalid, 0 Unknown, 0 Unchecked, 21.5s Time] [2022-07-14 04:47:22,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6948 states. [2022-07-14 04:47:22,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6948 to 3819. [2022-07-14 04:47:22,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3819 states, 2676 states have (on average 1.2328101644245142) internal successors, (3299), 2743 states have internal predecessors, (3299), 896 states have call successors, (896), 243 states have call predecessors, (896), 243 states have return successors, (896), 891 states have call predecessors, (896), 896 states have call successors, (896) [2022-07-14 04:47:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3819 states to 3819 states and 5091 transitions. [2022-07-14 04:47:22,311 INFO L78 Accepts]: Start accepts. Automaton has 3819 states and 5091 transitions. Word has length 307 [2022-07-14 04:47:22,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:47:22,311 INFO L495 AbstractCegarLoop]: Abstraction has 3819 states and 5091 transitions. [2022-07-14 04:47:22,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.466666666666667) internal successors, (127), 11 states have internal predecessors, (127), 2 states have call successors, (35), 5 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-14 04:47:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3819 states and 5091 transitions. [2022-07-14 04:47:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-07-14 04:47:22,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:47:22,313 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 9, 9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:47:22,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-14 04:47:22,314 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 27 more)] === [2022-07-14 04:47:22,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:47:22,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1555187807, now seen corresponding path program 1 times [2022-07-14 04:47:22,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:47:22,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056634366] [2022-07-14 04:47:22,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:47:22,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:47:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:47:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:47:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:47:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:47:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:47:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:47:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:47:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:47:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:47:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:47:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:47:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:47:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 04:47:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:47:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 04:47:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-14 04:47:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 04:47:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:47:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-14 04:47:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:47:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:47:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-14 04:47:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-14 04:47:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:47:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:47:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 04:47:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:47:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:47:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:47:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-07-14 04:47:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-14 04:47:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-14 04:47:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-07-14 04:47:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:47:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:47:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 04:47:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-07-14 04:47:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-07-14 04:47:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2022-07-14 04:47:22,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:47:22,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056634366] [2022-07-14 04:47:22,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056634366] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:47:22,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:47:22,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-14 04:47:22,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866012022] [2022-07-14 04:47:22,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:47:22,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 04:47:22,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:47:22,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 04:47:22,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-07-14 04:47:22,869 INFO L87 Difference]: Start difference. First operand 3819 states and 5091 transitions. Second operand has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 13 states have internal predecessors, (145), 2 states have call successors, (42), 6 states have call predecessors, (42), 2 states have return successors, (42), 3 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-14 04:47:29,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:47:42,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:47:55,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:47:55,913 INFO L93 Difference]: Finished difference Result 8522 states and 12102 transitions. [2022-07-14 04:47:55,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-07-14 04:47:55,913 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 13 states have internal predecessors, (145), 2 states have call successors, (42), 6 states have call predecessors, (42), 2 states have return successors, (42), 3 states have call predecessors, (42), 2 states have call successors, (42) Word has length 353 [2022-07-14 04:47:55,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:47:55,937 INFO L225 Difference]: With dead ends: 8522 [2022-07-14 04:47:55,937 INFO L226 Difference]: Without dead ends: 8520 [2022-07-14 04:47:55,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2309 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=976, Invalid=6856, Unknown=0, NotChecked=0, Total=7832 [2022-07-14 04:47:55,943 INFO L413 NwaCegarLoop]: 3753 mSDtfsCounter, 8227 mSDsluCounter, 22640 mSDsCounter, 0 mSdLazyCounter, 35789 mSolverCounterSat, 6674 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8468 SdHoareTripleChecker+Valid, 26393 SdHoareTripleChecker+Invalid, 42463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6674 IncrementalHoareTripleChecker+Valid, 35789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:47:55,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8468 Valid, 26393 Invalid, 42463 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6674 Valid, 35789 Invalid, 0 Unknown, 0 Unchecked, 30.5s Time] [2022-07-14 04:47:55,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8520 states. [2022-07-14 04:47:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8520 to 3949. [2022-07-14 04:47:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3949 states, 2775 states have (on average 1.2327927927927929) internal successors, (3421), 2847 states have internal predecessors, (3421), 926 states have call successors, (926), 243 states have call predecessors, (926), 244 states have return successors, (929), 921 states have call predecessors, (929), 926 states have call successors, (929) [2022-07-14 04:47:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 5276 transitions. [2022-07-14 04:47:56,363 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 5276 transitions. Word has length 353 [2022-07-14 04:47:56,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:47:56,364 INFO L495 AbstractCegarLoop]: Abstraction has 3949 states and 5276 transitions. [2022-07-14 04:47:56,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 13 states have internal predecessors, (145), 2 states have call successors, (42), 6 states have call predecessors, (42), 2 states have return successors, (42), 3 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-14 04:47:56,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 5276 transitions. [2022-07-14 04:47:56,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2022-07-14 04:47:56,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:47:56,367 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:47:56,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-14 04:47:56,368 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 27 more)] === [2022-07-14 04:47:56,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:47:56,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1868564358, now seen corresponding path program 1 times [2022-07-14 04:47:56,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:47:56,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074173723] [2022-07-14 04:47:56,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:47:56,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:47:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:47:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:47:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:47:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:47:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:47:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:47:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:47:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:47:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:47:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:47:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:47:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:47:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 04:47:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:47:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 04:47:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-14 04:47:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 04:47:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:47:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-14 04:47:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:47:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:47:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-14 04:47:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-14 04:47:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:47:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:47:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 04:47:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:47:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:47:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:47:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-07-14 04:47:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-14 04:47:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-14 04:47:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-07-14 04:47:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-07-14 04:47:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2022-07-14 04:47:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-07-14 04:47:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-14 04:47:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:47:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2022-07-14 04:47:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-14 04:47:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-07-14 04:47:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2022-07-14 04:47:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-07-14 04:47:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2022-07-14 04:47:56,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:47:56,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074173723] [2022-07-14 04:47:56,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074173723] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:47:56,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:47:56,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 04:47:56,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609426705] [2022-07-14 04:47:56,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:47:56,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 04:47:56,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:47:56,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 04:47:56,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:47:56,755 INFO L87 Difference]: Start difference. First operand 3949 states and 5276 transitions. Second operand has 10 states, 10 states have (on average 14.9) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (49), 7 states have call predecessors, (49), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2022-07-14 04:48:04,824 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:48:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:48:07,683 INFO L93 Difference]: Finished difference Result 8753 states and 11828 transitions. [2022-07-14 04:48:07,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 04:48:07,683 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.9) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (49), 7 states have call predecessors, (49), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 386 [2022-07-14 04:48:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:48:07,696 INFO L225 Difference]: With dead ends: 8753 [2022-07-14 04:48:07,697 INFO L226 Difference]: Without dead ends: 4823 [2022-07-14 04:48:07,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2022-07-14 04:48:07,707 INFO L413 NwaCegarLoop]: 2065 mSDtfsCounter, 5835 mSDsluCounter, 3213 mSDsCounter, 0 mSdLazyCounter, 8391 mSolverCounterSat, 4228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5850 SdHoareTripleChecker+Valid, 5278 SdHoareTripleChecker+Invalid, 12619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4228 IncrementalHoareTripleChecker+Valid, 8391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:48:07,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5850 Valid, 5278 Invalid, 12619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4228 Valid, 8391 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2022-07-14 04:48:07,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4823 states. [2022-07-14 04:48:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4823 to 3952. [2022-07-14 04:48:08,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 2778 states have (on average 1.232541396688265) internal successors, (3424), 2850 states have internal predecessors, (3424), 926 states have call successors, (926), 243 states have call predecessors, (926), 244 states have return successors, (929), 921 states have call predecessors, (929), 926 states have call successors, (929) [2022-07-14 04:48:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 5279 transitions. [2022-07-14 04:48:08,143 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 5279 transitions. Word has length 386 [2022-07-14 04:48:08,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:48:08,144 INFO L495 AbstractCegarLoop]: Abstraction has 3952 states and 5279 transitions. [2022-07-14 04:48:08,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.9) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (49), 7 states have call predecessors, (49), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2022-07-14 04:48:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 5279 transitions. [2022-07-14 04:48:08,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2022-07-14 04:48:08,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:48:08,147 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 9, 9, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:48:08,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-14 04:48:08,147 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 27 more)] === [2022-07-14 04:48:08,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:48:08,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1028228677, now seen corresponding path program 1 times [2022-07-14 04:48:08,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:48:08,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981121413] [2022-07-14 04:48:08,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:48:08,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:48:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:48:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:48:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:48:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:48:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:48:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:48:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:48:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:48:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:48:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:48:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:48:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:48:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:48:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:48:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:48:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 04:48:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:48:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 04:48:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-14 04:48:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 04:48:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:48:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:48:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-14 04:48:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:48:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:48:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-14 04:48:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:48:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-14 04:48:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:48:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:48:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:48:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 04:48:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:48:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:48:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:48:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-14 04:48:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-14 04:48:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-14 04:48:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-14 04:48:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-07-14 04:48:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-07-14 04:48:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-07-14 04:48:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-07-14 04:48:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-07-14 04:48:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-07-14 04:48:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-07-14 04:48:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2022-07-14 04:48:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2022-07-14 04:48:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-07-14 04:48:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-14 04:48:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:48:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:48:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2022-07-14 04:48:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2022-07-14 04:48:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2022-07-14 04:48:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2022-07-14 04:48:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 418 [2022-07-14 04:48:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2022-07-14 04:48:08,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:48:08,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981121413] [2022-07-14 04:48:08,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981121413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:48:08,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:48:08,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 04:48:08,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740728901] [2022-07-14 04:48:08,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:48:08,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 04:48:08,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:48:08,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 04:48:08,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:48:08,597 INFO L87 Difference]: Start difference. First operand 3952 states and 5279 transitions. Second operand has 10 states, 10 states have (on average 16.4) internal successors, (164), 4 states have internal predecessors, (164), 2 states have call successors, (56), 7 states have call predecessors, (56), 2 states have return successors, (52), 3 states have call predecessors, (52), 2 states have call successors, (52)