./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--media--rc--lirc_dev.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--media--rc--lirc_dev.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 21c7509b891e0ddc87dd83939d0ee5cb835b3606a1a2de3064d905837c808c7b --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 04:38:22,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:38:22,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:38:22,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:38:22,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:38:22,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:38:22,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:38:22,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:38:22,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:38:22,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:38:22,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:38:22,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:38:22,327 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:38:22,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:38:22,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:38:22,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:38:22,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:38:22,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:38:22,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:38:22,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:38:22,340 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:38:22,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:38:22,342 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:38:22,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:38:22,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:38:22,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:38:22,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:38:22,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:38:22,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:38:22,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:38:22,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:38:22,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:38:22,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:38:22,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:38:22,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:38:22,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:38:22,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:38:22,355 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:38:22,355 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:38:22,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:38:22,356 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:38:22,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:38:22,358 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:38:22,383 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:38:22,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:38:22,384 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:38:22,384 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:38:22,385 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:38:22,385 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:38:22,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:38:22,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:38:22,386 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:38:22,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:38:22,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:38:22,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:38:22,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:38:22,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:38:22,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:38:22,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:38:22,388 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:38:22,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:38:22,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:38:22,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:38:22,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:38:22,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:38:22,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:38:22,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:38:22,389 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:38:22,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:38:22,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:38:22,390 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:38:22,390 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:38:22,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:38:22,390 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 -> 21c7509b891e0ddc87dd83939d0ee5cb835b3606a1a2de3064d905837c808c7b [2022-07-14 04:38:22,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:38:22,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:38:22,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:38:22,604 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:38:22,604 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:38:22,605 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--media--rc--lirc_dev.ko.cil.i [2022-07-14 04:38:22,641 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cb223e4f/350c4362cb774defaa0986c5d288b0d6/FLAG1ea1b6120 [2022-07-14 04:38:23,216 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:38:23,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i [2022-07-14 04:38:23,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cb223e4f/350c4362cb774defaa0986c5d288b0d6/FLAG1ea1b6120 [2022-07-14 04:38:23,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cb223e4f/350c4362cb774defaa0986c5d288b0d6 [2022-07-14 04:38:23,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:38:23,408 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:38:23,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:38:23,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:38:23,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:38:23,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:38:23" (1/1) ... [2022-07-14 04:38:23,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92eefd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:38:23, skipping insertion in model container [2022-07-14 04:38:23,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:38:23" (1/1) ... [2022-07-14 04:38:23,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:38:23,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:38:25,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292064,292077] [2022-07-14 04:38:25,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292209,292222] [2022-07-14 04:38:25,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292355,292368] [2022-07-14 04:38:25,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292520,292533] [2022-07-14 04:38:25,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292678,292691] [2022-07-14 04:38:25,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292836,292849] [2022-07-14 04:38:25,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292994,293007] [2022-07-14 04:38:25,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293154,293167] [2022-07-14 04:38:25,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293313,293326] [2022-07-14 04:38:25,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293452,293465] [2022-07-14 04:38:25,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293594,293607] [2022-07-14 04:38:25,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293743,293756] [2022-07-14 04:38:25,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293882,293895] [2022-07-14 04:38:25,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294037,294050] [2022-07-14 04:38:25,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294197,294210] [2022-07-14 04:38:25,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294348,294361] [2022-07-14 04:38:25,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294499,294512] [2022-07-14 04:38:25,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294651,294664] [2022-07-14 04:38:25,237 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294800,294813] [2022-07-14 04:38:25,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294948,294961] [2022-07-14 04:38:25,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295105,295118] [2022-07-14 04:38:25,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295254,295267] [2022-07-14 04:38:25,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295410,295423] [2022-07-14 04:38:25,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295563,295576] [2022-07-14 04:38:25,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295709,295722] [2022-07-14 04:38:25,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295852,295865] [2022-07-14 04:38:25,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296004,296017] [2022-07-14 04:38:25,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296150,296163] [2022-07-14 04:38:25,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296295,296308] [2022-07-14 04:38:25,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296449,296462] [2022-07-14 04:38:25,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296600,296613] [2022-07-14 04:38:25,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296755,296768] [2022-07-14 04:38:25,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296907,296920] [2022-07-14 04:38:25,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297062,297075] [2022-07-14 04:38:25,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297226,297239] [2022-07-14 04:38:25,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297382,297395] [2022-07-14 04:38:25,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297546,297559] [2022-07-14 04:38:25,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297688,297701] [2022-07-14 04:38:25,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297846,297859] [2022-07-14 04:38:25,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298013,298026] [2022-07-14 04:38:25,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298172,298185] [2022-07-14 04:38:25,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298331,298344] [2022-07-14 04:38:25,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298480,298493] [2022-07-14 04:38:25,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298627,298640] [2022-07-14 04:38:25,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298766,298779] [2022-07-14 04:38:25,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298929,298942] [2022-07-14 04:38:25,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299095,299108] [2022-07-14 04:38:25,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299259,299272] [2022-07-14 04:38:25,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299424,299437] [2022-07-14 04:38:25,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299589,299602] [2022-07-14 04:38:25,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299755,299768] [2022-07-14 04:38:25,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299920,299933] [2022-07-14 04:38:25,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300087,300100] [2022-07-14 04:38:25,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300247,300260] [2022-07-14 04:38:25,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300409,300422] [2022-07-14 04:38:25,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300568,300581] [2022-07-14 04:38:25,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300714,300727] [2022-07-14 04:38:25,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300857,300870] [2022-07-14 04:38:25,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301001,301014] [2022-07-14 04:38:25,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301144,301157] [2022-07-14 04:38:25,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301288,301301] [2022-07-14 04:38:25,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301429,301442] [2022-07-14 04:38:25,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301567,301580] [2022-07-14 04:38:25,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301725,301738] [2022-07-14 04:38:25,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301884,301897] [2022-07-14 04:38:25,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302040,302053] [2022-07-14 04:38:25,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302189,302202] [2022-07-14 04:38:25,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302341,302354] [2022-07-14 04:38:25,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302492,302505] [2022-07-14 04:38:25,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302641,302654] [2022-07-14 04:38:25,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302793,302806] [2022-07-14 04:38:25,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302941,302954] [2022-07-14 04:38:25,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303094,303107] [2022-07-14 04:38:25,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303245,303258] [2022-07-14 04:38:25,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303395,303408] [2022-07-14 04:38:25,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303542,303555] [2022-07-14 04:38:25,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303693,303706] [2022-07-14 04:38:25,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303844,303857] [2022-07-14 04:38:25,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303992,304005] [2022-07-14 04:38:25,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304158,304171] [2022-07-14 04:38:25,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304327,304340] [2022-07-14 04:38:25,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304494,304507] [2022-07-14 04:38:25,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304662,304675] [2022-07-14 04:38:25,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304812,304825] [2022-07-14 04:38:25,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304959,304972] [2022-07-14 04:38:25,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305120,305133] [2022-07-14 04:38:25,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305290,305303] [2022-07-14 04:38:25,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305452,305465] [2022-07-14 04:38:25,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:38:25,309 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:38:25,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292064,292077] [2022-07-14 04:38:25,474 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292209,292222] [2022-07-14 04:38:25,474 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292355,292368] [2022-07-14 04:38:25,474 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292520,292533] [2022-07-14 04:38:25,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292678,292691] [2022-07-14 04:38:25,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292836,292849] [2022-07-14 04:38:25,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292994,293007] [2022-07-14 04:38:25,476 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293154,293167] [2022-07-14 04:38:25,476 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293313,293326] [2022-07-14 04:38:25,476 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293452,293465] [2022-07-14 04:38:25,476 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293594,293607] [2022-07-14 04:38:25,477 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293743,293756] [2022-07-14 04:38:25,477 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293882,293895] [2022-07-14 04:38:25,477 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294037,294050] [2022-07-14 04:38:25,477 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294197,294210] [2022-07-14 04:38:25,478 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294348,294361] [2022-07-14 04:38:25,478 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294499,294512] [2022-07-14 04:38:25,478 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294651,294664] [2022-07-14 04:38:25,479 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294800,294813] [2022-07-14 04:38:25,479 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294948,294961] [2022-07-14 04:38:25,479 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295105,295118] [2022-07-14 04:38:25,479 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295254,295267] [2022-07-14 04:38:25,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295410,295423] [2022-07-14 04:38:25,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295563,295576] [2022-07-14 04:38:25,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295709,295722] [2022-07-14 04:38:25,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295852,295865] [2022-07-14 04:38:25,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296004,296017] [2022-07-14 04:38:25,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296150,296163] [2022-07-14 04:38:25,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296295,296308] [2022-07-14 04:38:25,482 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296449,296462] [2022-07-14 04:38:25,482 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296600,296613] [2022-07-14 04:38:25,482 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296755,296768] [2022-07-14 04:38:25,482 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296907,296920] [2022-07-14 04:38:25,483 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297062,297075] [2022-07-14 04:38:25,483 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297226,297239] [2022-07-14 04:38:25,483 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297382,297395] [2022-07-14 04:38:25,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297546,297559] [2022-07-14 04:38:25,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297688,297701] [2022-07-14 04:38:25,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297846,297859] [2022-07-14 04:38:25,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298013,298026] [2022-07-14 04:38:25,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298172,298185] [2022-07-14 04:38:25,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298331,298344] [2022-07-14 04:38:25,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298480,298493] [2022-07-14 04:38:25,486 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298627,298640] [2022-07-14 04:38:25,486 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298766,298779] [2022-07-14 04:38:25,486 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298929,298942] [2022-07-14 04:38:25,486 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299095,299108] [2022-07-14 04:38:25,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299259,299272] [2022-07-14 04:38:25,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299424,299437] [2022-07-14 04:38:25,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299589,299602] [2022-07-14 04:38:25,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299755,299768] [2022-07-14 04:38:25,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299920,299933] [2022-07-14 04:38:25,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300087,300100] [2022-07-14 04:38:25,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300247,300260] [2022-07-14 04:38:25,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300409,300422] [2022-07-14 04:38:25,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300568,300581] [2022-07-14 04:38:25,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300714,300727] [2022-07-14 04:38:25,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300857,300870] [2022-07-14 04:38:25,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301001,301014] [2022-07-14 04:38:25,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301144,301157] [2022-07-14 04:38:25,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301288,301301] [2022-07-14 04:38:25,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301429,301442] [2022-07-14 04:38:25,491 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301567,301580] [2022-07-14 04:38:25,491 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301725,301738] [2022-07-14 04:38:25,491 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301884,301897] [2022-07-14 04:38:25,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302040,302053] [2022-07-14 04:38:25,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302189,302202] [2022-07-14 04:38:25,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302341,302354] [2022-07-14 04:38:25,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302492,302505] [2022-07-14 04:38:25,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302641,302654] [2022-07-14 04:38:25,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302793,302806] [2022-07-14 04:38:25,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302941,302954] [2022-07-14 04:38:25,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303094,303107] [2022-07-14 04:38:25,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303245,303258] [2022-07-14 04:38:25,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303395,303408] [2022-07-14 04:38:25,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303542,303555] [2022-07-14 04:38:25,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303693,303706] [2022-07-14 04:38:25,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303844,303857] [2022-07-14 04:38:25,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303992,304005] [2022-07-14 04:38:25,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304158,304171] [2022-07-14 04:38:25,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304327,304340] [2022-07-14 04:38:25,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304494,304507] [2022-07-14 04:38:25,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304662,304675] [2022-07-14 04:38:25,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304812,304825] [2022-07-14 04:38:25,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304959,304972] [2022-07-14 04:38:25,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305120,305133] [2022-07-14 04:38:25,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305290,305303] [2022-07-14 04:38:25,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305452,305465] [2022-07-14 04:38:25,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:38:25,592 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:38:25,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:38:25 WrapperNode [2022-07-14 04:38:25,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:38:25,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:38:25,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:38:25,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:38:25,598 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:38:25" (1/1) ... [2022-07-14 04:38:25,675 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:38:25" (1/1) ... [2022-07-14 04:38:25,737 INFO L137 Inliner]: procedures = 519, calls = 1770, calls flagged for inlining = 206, calls inlined = 55, statements flattened = 940 [2022-07-14 04:38:25,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:38:25,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:38:25,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:38:25,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:38:25,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:38:25" (1/1) ... [2022-07-14 04:38:25,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:38:25" (1/1) ... [2022-07-14 04:38:25,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:38:25" (1/1) ... [2022-07-14 04:38:25,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:38:25" (1/1) ... [2022-07-14 04:38:25,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:38:25" (1/1) ... [2022-07-14 04:38:25,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:38:25" (1/1) ... [2022-07-14 04:38:25,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:38:25" (1/1) ... [2022-07-14 04:38:25,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:38:25,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:38:25,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:38:25,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:38:25,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:38:25" (1/1) ... [2022-07-14 04:38:25,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:38:25,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:38:25,844 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:38:25,851 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:38:25,871 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_usb_gadget__class_registration_with_usb_gadget [2022-07-14 04:38:25,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_usb_gadget__class_registration_with_usb_gadget [2022-07-14 04:38:25,871 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-07-14 04:38:25,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-07-14 04:38:25,872 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:38:25,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:38:25,872 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:38:25,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:38:25,872 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:38:25,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:38:25,872 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:38:25,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:38:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:38:25,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:38:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:38:25,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:38:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:38:25,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:38:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:38:25,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:38:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:38:25,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:38:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:38:25,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:38:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:38:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:38:25,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:38:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:38:25,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:38:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_fs_char_dev__double_registration [2022-07-14 04:38:25,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_fs_char_dev__double_registration [2022-07-14 04:38:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:38:25,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:38:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:38:25,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:38:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:38:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:38:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:38:25,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:38:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:38:25,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:38:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:38:25,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:38:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-14 04:38:25,876 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-14 04:38:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:38:25,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:38:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_destroy_class [2022-07-14 04:38:25,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_destroy_class [2022-07-14 04:38:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:38:25,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:38:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:38:25,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:38:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:38:25,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:38:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_drivers_base_class__double_registration [2022-07-14 04:38:25,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_drivers_base_class__double_registration [2022-07-14 04:38:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_destroy_class [2022-07-14 04:38:25,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_destroy_class [2022-07-14 04:38:25,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:38:25,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:38:25,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:38:25,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:38:25,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:38:25,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:38:25,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:38:25,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:38:25,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:38:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:38:25,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:38:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:38:25,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:38:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 04:38:25,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 04:38:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:38:25,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:38:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:38:25,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:38:25,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:38:25,883 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadget [2022-07-14 04:38:25,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadget [2022-07-14 04:38:26,124 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:38:26,125 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:38:26,230 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:38:26,644 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:38:26,655 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:38:26,655 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 04:38:26,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:38:26 BoogieIcfgContainer [2022-07-14 04:38:26,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:38:26,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:38:26,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:38:26,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:38:26,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:38:23" (1/3) ... [2022-07-14 04:38:26,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdad158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:38:26, skipping insertion in model container [2022-07-14 04:38:26,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:38:25" (2/3) ... [2022-07-14 04:38:26,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdad158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:38:26, skipping insertion in model container [2022-07-14 04:38:26,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:38:26" (3/3) ... [2022-07-14 04:38:26,665 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i [2022-07-14 04:38:26,674 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:38:26,674 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-07-14 04:38:26,725 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:38:26,736 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@2217be7a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47064c2f [2022-07-14 04:38:26,736 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-07-14 04:38:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 374 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 263 states have internal predecessors, (302), 77 states have call successors, (77), 37 states have call predecessors, (77), 36 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2022-07-14 04:38:26,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-14 04:38:26,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:26,750 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:38:26,752 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_assert_linux_drivers_base_class__double_registrationErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:38:26,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:26,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1456749468, now seen corresponding path program 1 times [2022-07-14 04:38:26,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:26,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945071214] [2022-07-14 04:38:26,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:26,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:38:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:38:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:38:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 04:38:27,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:27,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945071214] [2022-07-14 04:38:27,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945071214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:27,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:27,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:27,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652058403] [2022-07-14 04:38:27,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:27,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:27,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:27,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:27,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:27,348 INFO L87 Difference]: Start difference. First operand has 374 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 263 states have internal predecessors, (302), 77 states have call successors, (77), 37 states have call predecessors, (77), 36 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 04:38:28,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:28,782 INFO L93 Difference]: Finished difference Result 1054 states and 1373 transitions. [2022-07-14 04:38:28,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:28,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2022-07-14 04:38:28,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:28,797 INFO L225 Difference]: With dead ends: 1054 [2022-07-14 04:38:28,811 INFO L226 Difference]: Without dead ends: 691 [2022-07-14 04:38:28,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:38:28,823 INFO L413 NwaCegarLoop]: 752 mSDtfsCounter, 539 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:28,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1491 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-14 04:38:28,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-07-14 04:38:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 480. [2022-07-14 04:38:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 302 states have (on average 1.1754966887417218) internal successors, (355), 336 states have internal predecessors, (355), 101 states have call successors, (101), 50 states have call predecessors, (101), 49 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2022-07-14 04:38:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 557 transitions. [2022-07-14 04:38:28,952 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 557 transitions. Word has length 35 [2022-07-14 04:38:28,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:28,953 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 557 transitions. [2022-07-14 04:38:28,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 04:38:28,954 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 557 transitions. [2022-07-14 04:38:28,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 04:38:28,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:28,956 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:38:28,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:38:28,956 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:38:28,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:28,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1101797720, now seen corresponding path program 1 times [2022-07-14 04:38:28,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:28,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307831857] [2022-07-14 04:38:28,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:28,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:38:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:38:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:38:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:38:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 04:38:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,434 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 04:38:29,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:29,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307831857] [2022-07-14 04:38:29,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307831857] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:29,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:29,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:29,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46691904] [2022-07-14 04:38:29,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:29,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:29,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:29,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:29,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:29,439 INFO L87 Difference]: Start difference. First operand 480 states and 557 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 04:38:30,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:30,016 INFO L93 Difference]: Finished difference Result 482 states and 559 transitions. [2022-07-14 04:38:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 04:38:30,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2022-07-14 04:38:30,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:30,020 INFO L225 Difference]: With dead ends: 482 [2022-07-14 04:38:30,020 INFO L226 Difference]: Without dead ends: 480 [2022-07-14 04:38:30,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:38:30,022 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 508 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:30,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 743 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 04:38:30,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-07-14 04:38:30,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 478. [2022-07-14 04:38:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 301 states have (on average 1.169435215946844) internal successors, (352), 334 states have internal predecessors, (352), 101 states have call successors, (101), 50 states have call predecessors, (101), 49 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2022-07-14 04:38:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 554 transitions. [2022-07-14 04:38:30,052 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 554 transitions. Word has length 48 [2022-07-14 04:38:30,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:30,052 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 554 transitions. [2022-07-14 04:38:30,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 04:38:30,053 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 554 transitions. [2022-07-14 04:38:30,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-14 04:38:30,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:30,056 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-14 04:38:30,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:38:30,056 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_fs_char_dev__double_registrationErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:38:30,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:30,057 INFO L85 PathProgramCache]: Analyzing trace with hash 951373245, now seen corresponding path program 1 times [2022-07-14 04:38:30,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:30,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260311523] [2022-07-14 04:38:30,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:30,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:38:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:38:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:38:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:38:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 04:38:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:38:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 04:38:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:38:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-14 04:38:30,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:30,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260311523] [2022-07-14 04:38:30,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260311523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:30,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:30,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:30,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915567003] [2022-07-14 04:38:30,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:30,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:30,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:30,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:30,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:30,279 INFO L87 Difference]: Start difference. First operand 478 states and 554 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (14), 3 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:38:30,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:30,974 INFO L93 Difference]: Finished difference Result 821 states and 930 transitions. [2022-07-14 04:38:30,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:30,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (14), 3 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 86 [2022-07-14 04:38:30,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:30,979 INFO L225 Difference]: With dead ends: 821 [2022-07-14 04:38:30,979 INFO L226 Difference]: Without dead ends: 819 [2022-07-14 04:38:30,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:38:30,980 INFO L413 NwaCegarLoop]: 468 mSDtfsCounter, 632 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:30,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 918 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 04:38:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-07-14 04:38:31,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 672. [2022-07-14 04:38:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 432 states have (on average 1.1828703703703705) internal successors, (511), 467 states have internal predecessors, (511), 137 states have call successors, (137), 78 states have call predecessors, (137), 77 states have return successors, (137), 131 states have call predecessors, (137), 135 states have call successors, (137) [2022-07-14 04:38:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 785 transitions. [2022-07-14 04:38:31,003 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 785 transitions. Word has length 86 [2022-07-14 04:38:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:31,004 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 785 transitions. [2022-07-14 04:38:31,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (14), 3 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:38:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 785 transitions. [2022-07-14 04:38:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-14 04:38:31,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:31,007 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-14 04:38:31,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 04:38:31,008 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:38:31,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash -292723993, now seen corresponding path program 1 times [2022-07-14 04:38:31,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:31,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782723178] [2022-07-14 04:38:31,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:31,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:38:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:38:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:38:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:38:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 04:38:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:38:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 04:38:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:38:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:38:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-14 04:38:31,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:31,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782723178] [2022-07-14 04:38:31,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782723178] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:31,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:31,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:31,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853164352] [2022-07-14 04:38:31,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:31,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:31,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:31,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:31,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:31,203 INFO L87 Difference]: Start difference. First operand 672 states and 785 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 3 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:38:31,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:31,616 INFO L93 Difference]: Finished difference Result 674 states and 787 transitions. [2022-07-14 04:38:31,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 04:38:31,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 3 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 105 [2022-07-14 04:38:31,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:31,620 INFO L225 Difference]: With dead ends: 674 [2022-07-14 04:38:31,620 INFO L226 Difference]: Without dead ends: 672 [2022-07-14 04:38:31,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:38:31,621 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 487 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:31,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 739 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 04:38:31,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-07-14 04:38:31,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 670. [2022-07-14 04:38:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 431 states have (on average 1.1763341067285382) internal successors, (507), 465 states have internal predecessors, (507), 137 states have call successors, (137), 78 states have call predecessors, (137), 77 states have return successors, (137), 131 states have call predecessors, (137), 135 states have call successors, (137) [2022-07-14 04:38:31,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 781 transitions. [2022-07-14 04:38:31,640 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 781 transitions. Word has length 105 [2022-07-14 04:38:31,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:31,640 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 781 transitions. [2022-07-14 04:38:31,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 3 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:38:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 781 transitions. [2022-07-14 04:38:31,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-14 04:38:31,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:31,642 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-14 04:38:31,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 04:38:31,643 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:38:31,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:31,643 INFO L85 PathProgramCache]: Analyzing trace with hash -876569357, now seen corresponding path program 1 times [2022-07-14 04:38:31,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:31,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913929984] [2022-07-14 04:38:31,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:31,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:38:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:38:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:38:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:38:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 04:38:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:38:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 04:38:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:38:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:38:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:38:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:38:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:38:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 04:38:31,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:31,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913929984] [2022-07-14 04:38:31,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913929984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:31,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:31,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 04:38:31,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142874437] [2022-07-14 04:38:31,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:31,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 04:38:31,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:31,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 04:38:31,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 04:38:31,827 INFO L87 Difference]: Start difference. First operand 670 states and 781 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 5 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:38:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:32,318 INFO L93 Difference]: Finished difference Result 672 states and 783 transitions. [2022-07-14 04:38:32,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 04:38:32,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 5 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 107 [2022-07-14 04:38:32,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:32,321 INFO L225 Difference]: With dead ends: 672 [2022-07-14 04:38:32,321 INFO L226 Difference]: Without dead ends: 670 [2022-07-14 04:38:32,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:38:32,322 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 838 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:32,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 717 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 04:38:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-07-14 04:38:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 668. [2022-07-14 04:38:32,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 430 states have (on average 1.172093023255814) internal successors, (504), 463 states have internal predecessors, (504), 137 states have call successors, (137), 78 states have call predecessors, (137), 77 states have return successors, (137), 131 states have call predecessors, (137), 135 states have call successors, (137) [2022-07-14 04:38:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 778 transitions. [2022-07-14 04:38:32,344 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 778 transitions. Word has length 107 [2022-07-14 04:38:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:32,344 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 778 transitions. [2022-07-14 04:38:32,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 5 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:38:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 778 transitions. [2022-07-14 04:38:32,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-14 04:38:32,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:32,346 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-14 04:38:32,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 04:38:32,346 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:38:32,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:32,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1725971280, now seen corresponding path program 1 times [2022-07-14 04:38:32,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:32,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861486217] [2022-07-14 04:38:32,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:32,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:38:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:38:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:38:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:38:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 04:38:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:38:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 04:38:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:38:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:38:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:38:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:38:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:38:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:38:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 04:38:32,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:32,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861486217] [2022-07-14 04:38:32,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861486217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:32,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:32,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 04:38:32,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426209625] [2022-07-14 04:38:32,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:32,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 04:38:32,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:32,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 04:38:32,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 04:38:32,526 INFO L87 Difference]: Start difference. First operand 668 states and 778 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 5 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:38:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:33,019 INFO L93 Difference]: Finished difference Result 670 states and 780 transitions. [2022-07-14 04:38:33,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 04:38:33,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 5 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 113 [2022-07-14 04:38:33,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:33,022 INFO L225 Difference]: With dead ends: 670 [2022-07-14 04:38:33,022 INFO L226 Difference]: Without dead ends: 668 [2022-07-14 04:38:33,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:38:33,023 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 830 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:33,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 715 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 04:38:33,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-07-14 04:38:33,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 666. [2022-07-14 04:38:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 429 states have (on average 1.167832167832168) internal successors, (501), 461 states have internal predecessors, (501), 137 states have call successors, (137), 78 states have call predecessors, (137), 77 states have return successors, (137), 131 states have call predecessors, (137), 135 states have call successors, (137) [2022-07-14 04:38:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 775 transitions. [2022-07-14 04:38:33,044 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 775 transitions. Word has length 113 [2022-07-14 04:38:33,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:33,044 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 775 transitions. [2022-07-14 04:38:33,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 5 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:38:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 775 transitions. [2022-07-14 04:38:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-14 04:38:33,046 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:33,046 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:38:33,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 04:38:33,046 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:38:33,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:33,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1315263575, now seen corresponding path program 1 times [2022-07-14 04:38:33,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:33,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755520704] [2022-07-14 04:38:33,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:33,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:38:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:38:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:38:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:38:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 04:38:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:38:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 04:38:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:38:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:38:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:38:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:38:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:38:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-14 04:38:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-14 04:38:33,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:33,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755520704] [2022-07-14 04:38:33,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755520704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:33,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:33,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-14 04:38:33,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094834844] [2022-07-14 04:38:33,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:33,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 04:38:33,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:33,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 04:38:33,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-07-14 04:38:33,369 INFO L87 Difference]: Start difference. First operand 666 states and 775 transitions. Second operand has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2022-07-14 04:38:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:35,786 INFO L93 Difference]: Finished difference Result 1556 states and 1785 transitions. [2022-07-14 04:38:35,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 04:38:35,786 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) Word has length 114 [2022-07-14 04:38:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:35,791 INFO L225 Difference]: With dead ends: 1556 [2022-07-14 04:38:35,791 INFO L226 Difference]: Without dead ends: 1317 [2022-07-14 04:38:35,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=771, Unknown=0, NotChecked=0, Total=930 [2022-07-14 04:38:35,792 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 1539 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 3608 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 4476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 3608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:35,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 1739 Invalid, 4476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 3608 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-14 04:38:35,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2022-07-14 04:38:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 902. [2022-07-14 04:38:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 587 states have (on average 1.161839863713799) internal successors, (682), 628 states have internal predecessors, (682), 188 states have call successors, (188), 104 states have call predecessors, (188), 104 states have return successors, (188), 178 states have call predecessors, (188), 186 states have call successors, (188) [2022-07-14 04:38:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1058 transitions. [2022-07-14 04:38:35,830 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1058 transitions. Word has length 114 [2022-07-14 04:38:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:35,830 INFO L495 AbstractCegarLoop]: Abstraction has 902 states and 1058 transitions. [2022-07-14 04:38:35,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2022-07-14 04:38:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1058 transitions. [2022-07-14 04:38:35,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-14 04:38:35,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:35,832 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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] [2022-07-14 04:38:35,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:38:35,832 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:38:35,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:35,833 INFO L85 PathProgramCache]: Analyzing trace with hash -331086751, now seen corresponding path program 1 times [2022-07-14 04:38:35,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:35,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618725124] [2022-07-14 04:38:35,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:35,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:35,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:35,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:38:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:38:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:38:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:38:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 04:38:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:38:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 04:38:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:38:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:38:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:38:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:38:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-14 04:38:36,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:36,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618725124] [2022-07-14 04:38:36,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618725124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:36,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:36,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 04:38:36,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599066643] [2022-07-14 04:38:36,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:36,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 04:38:36,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:36,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 04:38:36,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-14 04:38:36,097 INFO L87 Difference]: Start difference. First operand 902 states and 1058 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-07-14 04:38:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:37,896 INFO L93 Difference]: Finished difference Result 1829 states and 2159 transitions. [2022-07-14 04:38:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 04:38:37,897 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 122 [2022-07-14 04:38:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:37,903 INFO L225 Difference]: With dead ends: 1829 [2022-07-14 04:38:37,903 INFO L226 Difference]: Without dead ends: 1329 [2022-07-14 04:38:37,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2022-07-14 04:38:37,906 INFO L413 NwaCegarLoop]: 454 mSDtfsCounter, 846 mSDsluCounter, 1903 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 791 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 4298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 791 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:37,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 2357 Invalid, 4298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [791 Valid, 3507 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-14 04:38:37,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-07-14 04:38:37,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 887. [2022-07-14 04:38:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 575 states have (on average 1.151304347826087) internal successors, (662), 616 states have internal predecessors, (662), 185 states have call successors, (185), 104 states have call predecessors, (185), 104 states have return successors, (184), 175 states have call predecessors, (184), 183 states have call successors, (184) [2022-07-14 04:38:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1031 transitions. [2022-07-14 04:38:37,947 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1031 transitions. Word has length 122 [2022-07-14 04:38:37,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:37,947 INFO L495 AbstractCegarLoop]: Abstraction has 887 states and 1031 transitions. [2022-07-14 04:38:37,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-07-14 04:38:37,948 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1031 transitions. [2022-07-14 04:38:37,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-14 04:38:37,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:37,950 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:38:37,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 04:38:37,950 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:38:37,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:37,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1688734875, now seen corresponding path program 1 times [2022-07-14 04:38:37,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:37,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391143549] [2022-07-14 04:38:37,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:37,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:38:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:38:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:38:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:38:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 04:38:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:38:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 04:38:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:38:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:38:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:38:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:38:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:38:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:38:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 04:38:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 04:38:38,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:38,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391143549] [2022-07-14 04:38:38,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391143549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:38,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:38,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-14 04:38:38,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107471903] [2022-07-14 04:38:38,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:38,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 04:38:38,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:38,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 04:38:38,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-07-14 04:38:38,394 INFO L87 Difference]: Start difference. First operand 887 states and 1031 transitions. Second operand has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-14 04:38:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:41,518 INFO L93 Difference]: Finished difference Result 1504 states and 1714 transitions. [2022-07-14 04:38:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 04:38:41,519 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) Word has length 117 [2022-07-14 04:38:41,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:41,523 INFO L225 Difference]: With dead ends: 1504 [2022-07-14 04:38:41,523 INFO L226 Difference]: Without dead ends: 1199 [2022-07-14 04:38:41,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=1519, Unknown=0, NotChecked=0, Total=1806 [2022-07-14 04:38:41,526 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 1859 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 4699 mSolverCounterSat, 1077 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1869 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 5776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1077 IncrementalHoareTripleChecker+Valid, 4699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:41,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1869 Valid, 2156 Invalid, 5776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1077 Valid, 4699 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-14 04:38:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2022-07-14 04:38:41,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 883. [2022-07-14 04:38:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 571 states have (on average 1.148861646234676) internal successors, (656), 612 states have internal predecessors, (656), 185 states have call successors, (185), 104 states have call predecessors, (185), 104 states have return successors, (184), 175 states have call predecessors, (184), 183 states have call successors, (184) [2022-07-14 04:38:41,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1025 transitions. [2022-07-14 04:38:41,575 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1025 transitions. Word has length 117 [2022-07-14 04:38:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:41,575 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1025 transitions. [2022-07-14 04:38:41,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-14 04:38:41,576 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1025 transitions. [2022-07-14 04:38:41,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-14 04:38:41,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:41,577 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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] [2022-07-14 04:38:41,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 04:38:41,578 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_usb_gadget_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:38:41,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:41,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1438984896, now seen corresponding path program 1 times [2022-07-14 04:38:41,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:41,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29612020] [2022-07-14 04:38:41,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:41,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:38:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:38:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:38:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:38:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 04:38:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:38:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 04:38:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:38:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:38:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:38:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:38:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:38:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-14 04:38:41,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:41,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29612020] [2022-07-14 04:38:41,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29612020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:41,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:41,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:41,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889586091] [2022-07-14 04:38:41,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:41,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:41,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:41,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:41,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:41,729 INFO L87 Difference]: Start difference. First operand 883 states and 1025 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, (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:38:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:42,225 INFO L93 Difference]: Finished difference Result 897 states and 1046 transitions. [2022-07-14 04:38:42,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:42,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (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 127 [2022-07-14 04:38:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:42,229 INFO L225 Difference]: With dead ends: 897 [2022-07-14 04:38:42,229 INFO L226 Difference]: Without dead ends: 895 [2022-07-14 04:38:42,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:38:42,230 INFO L413 NwaCegarLoop]: 382 mSDtfsCounter, 643 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:42,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 642 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 04:38:42,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-07-14 04:38:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 881. [2022-07-14 04:38:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 570 states have (on average 1.1403508771929824) internal successors, (650), 610 states have internal predecessors, (650), 185 states have call successors, (185), 104 states have call predecessors, (185), 104 states have return successors, (184), 175 states have call predecessors, (184), 183 states have call successors, (184) [2022-07-14 04:38:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1019 transitions. [2022-07-14 04:38:42,274 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1019 transitions. Word has length 127 [2022-07-14 04:38:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:42,275 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1019 transitions. [2022-07-14 04:38:42,275 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, (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:38:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1019 transitions. [2022-07-14 04:38:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-14 04:38:42,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:42,276 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 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] [2022-07-14 04:38:42,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 04:38:42,277 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:38:42,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:42,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1921822841, now seen corresponding path program 1 times [2022-07-14 04:38:42,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:42,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746336607] [2022-07-14 04:38:42,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:42,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:38:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:38:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:38:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:38:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:38:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:38:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 04:38:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:38:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:38:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:38:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:38:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:38:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:38:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:38:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-14 04:38:42,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:42,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746336607] [2022-07-14 04:38:42,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746336607] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:38:42,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112914340] [2022-07-14 04:38:42,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:42,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:38:42,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:38:42,790 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:38:42,793 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:38:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 1929 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-14 04:38:43,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:38:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 105 proven. 8 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-14 04:38:43,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:38:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-14 04:38:43,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112914340] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:38:43,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 04:38:43,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 31 [2022-07-14 04:38:43,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073572302] [2022-07-14 04:38:43,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 04:38:43,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-14 04:38:43,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:43,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-14 04:38:43,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-07-14 04:38:43,951 INFO L87 Difference]: Start difference. First operand 881 states and 1019 transitions. Second operand has 31 states, 25 states have (on average 3.88) internal successors, (97), 22 states have internal predecessors, (97), 10 states have call successors, (38), 3 states have call predecessors, (38), 9 states have return successors, (39), 15 states have call predecessors, (39), 10 states have call successors, (39) [2022-07-14 04:38:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:46,236 INFO L93 Difference]: Finished difference Result 1691 states and 1940 transitions. [2022-07-14 04:38:46,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 04:38:46,236 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 3.88) internal successors, (97), 22 states have internal predecessors, (97), 10 states have call successors, (38), 3 states have call predecessors, (38), 9 states have return successors, (39), 15 states have call predecessors, (39), 10 states have call successors, (39) Word has length 138 [2022-07-14 04:38:46,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:46,240 INFO L225 Difference]: With dead ends: 1691 [2022-07-14 04:38:46,240 INFO L226 Difference]: Without dead ends: 883 [2022-07-14 04:38:46,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 297 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=1546, Unknown=0, NotChecked=0, Total=1722 [2022-07-14 04:38:46,242 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 520 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 4332 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 4764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 4332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:46,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 2328 Invalid, 4764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 4332 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-14 04:38:46,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-07-14 04:38:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 881. [2022-07-14 04:38:46,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 570 states have (on average 1.1333333333333333) internal successors, (646), 606 states have internal predecessors, (646), 185 states have call successors, (185), 104 states have call predecessors, (185), 104 states have return successors, (184), 175 states have call predecessors, (184), 183 states have call successors, (184) [2022-07-14 04:38:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1015 transitions. [2022-07-14 04:38:46,326 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1015 transitions. Word has length 138 [2022-07-14 04:38:46,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:46,326 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1015 transitions. [2022-07-14 04:38:46,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 3.88) internal successors, (97), 22 states have internal predecessors, (97), 10 states have call successors, (38), 3 states have call predecessors, (38), 9 states have return successors, (39), 15 states have call predecessors, (39), 10 states have call successors, (39) [2022-07-14 04:38:46,326 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1015 transitions. [2022-07-14 04:38:46,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-14 04:38:46,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:46,328 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 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] [2022-07-14 04:38:46,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 04:38:46,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-14 04:38:46,548 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:38:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:46,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1893739651, now seen corresponding path program 1 times [2022-07-14 04:38:46,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:46,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302976088] [2022-07-14 04:38:46,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:46,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:38:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:38:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:38:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:38:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:38:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:38:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 04:38:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:38:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:38:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:38:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:38:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:38:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 04:38:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:38:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:38:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-14 04:38:47,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:47,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302976088] [2022-07-14 04:38:47,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302976088] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:38:47,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826157539] [2022-07-14 04:38:47,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:47,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:38:47,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:38:47,204 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:38:47,205 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:38:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:47,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 1939 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-14 04:38:47,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:38:48,134 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-14 04:38:48,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:38:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-07-14 04:38:48,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826157539] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:38:48,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 04:38:48,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 16] total 46 [2022-07-14 04:38:48,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602735071] [2022-07-14 04:38:48,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 04:38:48,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-14 04:38:48,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:48,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-14 04:38:48,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2022-07-14 04:38:48,805 INFO L87 Difference]: Start difference. First operand 881 states and 1015 transitions. Second operand has 46 states, 40 states have (on average 3.1) internal successors, (124), 34 states have internal predecessors, (124), 12 states have call successors, (48), 4 states have call predecessors, (48), 12 states have return successors, (49), 18 states have call predecessors, (49), 12 states have call successors, (49) [2022-07-14 04:38:54,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:54,743 INFO L93 Difference]: Finished difference Result 1562 states and 1821 transitions. [2022-07-14 04:38:54,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 04:38:54,744 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 40 states have (on average 3.1) internal successors, (124), 34 states have internal predecessors, (124), 12 states have call successors, (48), 4 states have call predecessors, (48), 12 states have return successors, (49), 18 states have call predecessors, (49), 12 states have call successors, (49) Word has length 143 [2022-07-14 04:38:54,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:54,747 INFO L225 Difference]: With dead ends: 1562 [2022-07-14 04:38:54,748 INFO L226 Difference]: Without dead ends: 842 [2022-07-14 04:38:54,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=254, Invalid=3652, Unknown=0, NotChecked=0, Total=3906 [2022-07-14 04:38:54,750 INFO L413 NwaCegarLoop]: 485 mSDtfsCounter, 436 mSDsluCounter, 6746 mSDsCounter, 0 mSdLazyCounter, 10591 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 7231 SdHoareTripleChecker+Invalid, 11089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 10591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:54,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 7231 Invalid, 11089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 10591 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-14 04:38:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-07-14 04:38:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 767. [2022-07-14 04:38:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 495 states have (on average 1.1373737373737374) internal successors, (563), 527 states have internal predecessors, (563), 157 states have call successors, (157), 93 states have call predecessors, (157), 93 states have return successors, (156), 150 states have call predecessors, (156), 155 states have call successors, (156) [2022-07-14 04:38:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 876 transitions. [2022-07-14 04:38:54,907 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 876 transitions. Word has length 143 [2022-07-14 04:38:54,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:54,908 INFO L495 AbstractCegarLoop]: Abstraction has 767 states and 876 transitions. [2022-07-14 04:38:54,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 40 states have (on average 3.1) internal successors, (124), 34 states have internal predecessors, (124), 12 states have call successors, (48), 4 states have call predecessors, (48), 12 states have return successors, (49), 18 states have call predecessors, (49), 12 states have call successors, (49) [2022-07-14 04:38:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 876 transitions. [2022-07-14 04:38:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-14 04:38:54,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:54,911 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 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] [2022-07-14 04:38:54,930 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:38:55,129 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,SelfDestructingSolverStorable11 [2022-07-14 04:38:55,130 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:38:55,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:55,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1252398581, now seen corresponding path program 1 times [2022-07-14 04:38:55,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:55,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369098482] [2022-07-14 04:38:55,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:55,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:38:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:38:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:38:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:38:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:38:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:38:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:38:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:38:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:38:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:38:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:38:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:38:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:38:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:38:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:38:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:38:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-07-14 04:38:55,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:55,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369098482] [2022-07-14 04:38:55,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369098482] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:55,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:55,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 04:38:55,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088223027] [2022-07-14 04:38:55,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:55,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 04:38:55,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:55,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 04:38:55,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 04:38:55,343 INFO L87 Difference]: Start difference. First operand 767 states and 876 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (22), 3 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:38:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:55,955 INFO L93 Difference]: Finished difference Result 1203 states and 1371 transitions. [2022-07-14 04:38:55,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:55,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (22), 3 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 149 [2022-07-14 04:38:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:55,960 INFO L225 Difference]: With dead ends: 1203 [2022-07-14 04:38:55,960 INFO L226 Difference]: Without dead ends: 1201 [2022-07-14 04:38:55,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:38:55,962 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 585 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:55,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 748 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 04:38:55,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-07-14 04:38:56,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 889. [2022-07-14 04:38:56,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 575 states have (on average 1.1356521739130434) internal successors, (653), 611 states have internal predecessors, (653), 181 states have call successors, (181), 109 states have call predecessors, (181), 111 states have return successors, (186), 172 states have call predecessors, (186), 179 states have call successors, (186) [2022-07-14 04:38:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1020 transitions. [2022-07-14 04:38:56,070 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1020 transitions. Word has length 149 [2022-07-14 04:38:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:56,071 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1020 transitions. [2022-07-14 04:38:56,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (22), 3 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:38:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1020 transitions. [2022-07-14 04:38:56,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-14 04:38:56,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:56,073 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:56,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 04:38:56,073 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:38:56,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:56,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1102990983, now seen corresponding path program 1 times [2022-07-14 04:38:56,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:56,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210535866] [2022-07-14 04:38:56,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:56,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:56,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:56,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:38:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:56,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:56,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:38:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:56,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:38:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:56,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:38:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:56,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:38:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:56,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:38:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:56,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:38:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:56,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:38:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:56,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:38:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:56,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:38:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:56,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:38:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:56,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:38:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:56,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:57,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:38:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:57,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:38:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:57,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 04:38:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:57,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:57,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:38:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:57,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:38:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:57,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:38:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:57,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:38:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-14 04:38:57,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:57,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210535866] [2022-07-14 04:38:57,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210535866] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:38:57,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026945032] [2022-07-14 04:38:57,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:57,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:38:57,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:38:57,228 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:38:57,272 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:38:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:57,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 1933 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-14 04:38:57,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:38:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-14 04:38:58,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:38:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-14 04:38:58,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026945032] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:38:58,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 04:38:58,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 15] total 40 [2022-07-14 04:38:58,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120161800] [2022-07-14 04:38:58,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 04:38:58,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-14 04:38:58,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:58,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-14 04:38:58,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1455, Unknown=0, NotChecked=0, Total=1560 [2022-07-14 04:38:58,959 INFO L87 Difference]: Start difference. First operand 889 states and 1020 transitions. Second operand has 40 states, 36 states have (on average 4.416666666666667) internal successors, (159), 33 states have internal predecessors, (159), 17 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (57), 16 states have call predecessors, (57), 17 states have call successors, (57) [2022-07-14 04:39:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:05,946 INFO L93 Difference]: Finished difference Result 1433 states and 1590 transitions. [2022-07-14 04:39:05,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-14 04:39:05,947 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 4.416666666666667) internal successors, (159), 33 states have internal predecessors, (159), 17 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (57), 16 states have call predecessors, (57), 17 states have call successors, (57) Word has length 144 [2022-07-14 04:39:05,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:05,951 INFO L225 Difference]: With dead ends: 1433 [2022-07-14 04:39:05,951 INFO L226 Difference]: Without dead ends: 1159 [2022-07-14 04:39:05,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 309 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=576, Invalid=5124, Unknown=0, NotChecked=0, Total=5700 [2022-07-14 04:39:05,959 INFO L413 NwaCegarLoop]: 557 mSDtfsCounter, 1714 mSDsluCounter, 4069 mSDsCounter, 0 mSdLazyCounter, 11348 mSolverCounterSat, 1355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 4626 SdHoareTripleChecker+Invalid, 12703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1355 IncrementalHoareTripleChecker+Valid, 11348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:05,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 4626 Invalid, 12703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1355 Valid, 11348 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-14 04:39:05,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-07-14 04:39:06,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 884. [2022-07-14 04:39:06,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 574 states have (on average 1.1289198606271778) internal successors, (648), 610 states have internal predecessors, (648), 175 states have call successors, (175), 109 states have call predecessors, (175), 113 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2022-07-14 04:39:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1005 transitions. [2022-07-14 04:39:06,229 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1005 transitions. Word has length 144 [2022-07-14 04:39:06,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:06,229 INFO L495 AbstractCegarLoop]: Abstraction has 884 states and 1005 transitions. [2022-07-14 04:39:06,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 4.416666666666667) internal successors, (159), 33 states have internal predecessors, (159), 17 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (57), 16 states have call predecessors, (57), 17 states have call successors, (57) [2022-07-14 04:39:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1005 transitions. [2022-07-14 04:39:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-14 04:39:06,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:06,232 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:06,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 04:39:06,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:39:06,444 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:39:06,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:06,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1777528727, now seen corresponding path program 1 times [2022-07-14 04:39:06,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:06,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583429919] [2022-07-14 04:39:06,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:06,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:39:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:39:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:39:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:39:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:39:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:39:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:39:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:39:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:39:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:39:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:39:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:39:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 04:39:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:39:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:39:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:39:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 04:39:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-14 04:39:06,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:06,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583429919] [2022-07-14 04:39:06,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583429919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:06,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:06,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 04:39:06,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839338517] [2022-07-14 04:39:06,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:06,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 04:39:06,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:06,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 04:39:06,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 04:39:06,626 INFO L87 Difference]: Start difference. First operand 884 states and 1005 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (24), 5 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:39:07,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:07,208 INFO L93 Difference]: Finished difference Result 884 states and 1005 transitions. [2022-07-14 04:39:07,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 04:39:07,209 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (24), 5 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 146 [2022-07-14 04:39:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:07,214 INFO L225 Difference]: With dead ends: 884 [2022-07-14 04:39:07,214 INFO L226 Difference]: Without dead ends: 882 [2022-07-14 04:39:07,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:39:07,217 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 811 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:07,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 701 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 04:39:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2022-07-14 04:39:07,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2022-07-14 04:39:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 573 states have (on average 1.12565445026178) internal successors, (645), 608 states have internal predecessors, (645), 175 states have call successors, (175), 109 states have call predecessors, (175), 113 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2022-07-14 04:39:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1002 transitions. [2022-07-14 04:39:07,368 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1002 transitions. Word has length 146 [2022-07-14 04:39:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:07,368 INFO L495 AbstractCegarLoop]: Abstraction has 882 states and 1002 transitions. [2022-07-14 04:39:07,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (24), 5 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:39:07,369 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1002 transitions. [2022-07-14 04:39:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-14 04:39:07,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:07,371 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2022-07-14 04:39:07,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 04:39:07,371 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:39:07,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:07,372 INFO L85 PathProgramCache]: Analyzing trace with hash -608956573, now seen corresponding path program 1 times [2022-07-14 04:39:07,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:07,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285163094] [2022-07-14 04:39:07,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:07,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:39:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:39:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:39:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:39:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:39:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:39:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:39:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:39:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:39:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:39:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:39:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:39:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 04:39:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:39:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:39:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:39:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:39:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-14 04:39:08,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:08,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285163094] [2022-07-14 04:39:08,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285163094] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:39:08,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292383609] [2022-07-14 04:39:08,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:08,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:39:08,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:39:08,418 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 04:39:08,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 04:39:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:08,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 1952 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-14 04:39:08,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:39:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-14 04:39:09,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:39:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-14 04:39:09,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292383609] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:39:09,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 04:39:09,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16, 15] total 50 [2022-07-14 04:39:09,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904729984] [2022-07-14 04:39:09,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 04:39:09,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-14 04:39:09,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:09,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-14 04:39:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2321, Unknown=0, NotChecked=0, Total=2450 [2022-07-14 04:39:09,914 INFO L87 Difference]: Start difference. First operand 882 states and 1002 transitions. Second operand has 50 states, 43 states have (on average 3.86046511627907) internal successors, (166), 40 states have internal predecessors, (166), 20 states have call successors, (63), 6 states have call predecessors, (63), 9 states have return successors, (65), 25 states have call predecessors, (65), 20 states have call successors, (65) [2022-07-14 04:39:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:16,247 INFO L93 Difference]: Finished difference Result 1072 states and 1195 transitions. [2022-07-14 04:39:16,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-14 04:39:16,248 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 43 states have (on average 3.86046511627907) internal successors, (166), 40 states have internal predecessors, (166), 20 states have call successors, (63), 6 states have call predecessors, (63), 9 states have return successors, (65), 25 states have call predecessors, (65), 20 states have call successors, (65) Word has length 150 [2022-07-14 04:39:16,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:16,251 INFO L225 Difference]: With dead ends: 1072 [2022-07-14 04:39:16,251 INFO L226 Difference]: Without dead ends: 898 [2022-07-14 04:39:16,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 321 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=564, Invalid=6078, Unknown=0, NotChecked=0, Total=6642 [2022-07-14 04:39:16,254 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 2008 mSDsluCounter, 2655 mSDsCounter, 0 mSdLazyCounter, 7807 mSolverCounterSat, 1441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 2965 SdHoareTripleChecker+Invalid, 9248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1441 IncrementalHoareTripleChecker+Valid, 7807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:16,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 2965 Invalid, 9248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1441 Valid, 7807 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-14 04:39:16,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2022-07-14 04:39:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 894. [2022-07-14 04:39:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 581 states have (on average 1.1239242685025816) internal successors, (653), 618 states have internal predecessors, (653), 175 states have call successors, (175), 111 states have call predecessors, (175), 117 states have return successors, (186), 168 states have call predecessors, (186), 173 states have call successors, (186) [2022-07-14 04:39:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1014 transitions. [2022-07-14 04:39:16,555 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1014 transitions. Word has length 150 [2022-07-14 04:39:16,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:16,556 INFO L495 AbstractCegarLoop]: Abstraction has 894 states and 1014 transitions. [2022-07-14 04:39:16,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 43 states have (on average 3.86046511627907) internal successors, (166), 40 states have internal predecessors, (166), 20 states have call successors, (63), 6 states have call predecessors, (63), 9 states have return successors, (65), 25 states have call predecessors, (65), 20 states have call successors, (65) [2022-07-14 04:39:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1014 transitions. [2022-07-14 04:39:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-14 04:39:16,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:16,559 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:16,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 04:39:16,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-14 04:39:16,778 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:39:16,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:16,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1189834910, now seen corresponding path program 1 times [2022-07-14 04:39:16,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:16,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50368987] [2022-07-14 04:39:16,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:16,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:39:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:39:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:39:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:39:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:39:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:39:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:39:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:39:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:39:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:39:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:39:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:39:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 04:39:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:39:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:39:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:39:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 04:39:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 04:39:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:16,942 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-14 04:39:16,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:16,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50368987] [2022-07-14 04:39:16,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50368987] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:16,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:16,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 04:39:16,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849266366] [2022-07-14 04:39:16,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:16,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 04:39:16,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:16,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 04:39:16,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 04:39:16,944 INFO L87 Difference]: Start difference. First operand 894 states and 1014 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (25), 5 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:39:17,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:17,549 INFO L93 Difference]: Finished difference Result 894 states and 1014 transitions. [2022-07-14 04:39:17,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 04:39:17,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (25), 5 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 152 [2022-07-14 04:39:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:17,554 INFO L225 Difference]: With dead ends: 894 [2022-07-14 04:39:17,554 INFO L226 Difference]: Without dead ends: 892 [2022-07-14 04:39:17,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:39:17,555 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 803 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:17,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 699 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 04:39:17,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2022-07-14 04:39:17,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2022-07-14 04:39:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 580 states have (on average 1.1206896551724137) internal successors, (650), 616 states have internal predecessors, (650), 175 states have call successors, (175), 111 states have call predecessors, (175), 117 states have return successors, (186), 168 states have call predecessors, (186), 173 states have call successors, (186) [2022-07-14 04:39:17,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1011 transitions. [2022-07-14 04:39:17,686 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1011 transitions. Word has length 152 [2022-07-14 04:39:17,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:17,686 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 1011 transitions. [2022-07-14 04:39:17,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (25), 5 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:39:17,686 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1011 transitions. [2022-07-14 04:39:17,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-14 04:39:17,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:17,688 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 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] [2022-07-14 04:39:17,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 04:39:17,688 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:39:17,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:17,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1381837497, now seen corresponding path program 1 times [2022-07-14 04:39:17,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:17,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901670768] [2022-07-14 04:39:17,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:17,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:17,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:17,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:39:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:39:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:39:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:39:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:39:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:39:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:39:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:39:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:39:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:39:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:39:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:39:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 04:39:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:39:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:39:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:39:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:39:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-14 04:39:18,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:18,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901670768] [2022-07-14 04:39:18,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901670768] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:39:18,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096657019] [2022-07-14 04:39:18,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:18,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:39:18,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:39:18,382 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 04:39:18,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 04:39:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 1971 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-14 04:39:18,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:39:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 71 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-14 04:39:19,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:39:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-14 04:39:20,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096657019] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:39:20,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 04:39:20,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20, 16] total 48 [2022-07-14 04:39:20,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214835614] [2022-07-14 04:39:20,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 04:39:20,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-14 04:39:20,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:20,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-14 04:39:20,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2121, Unknown=0, NotChecked=0, Total=2256 [2022-07-14 04:39:20,441 INFO L87 Difference]: Start difference. First operand 892 states and 1011 transitions. Second operand has 48 states, 44 states have (on average 3.590909090909091) internal successors, (158), 35 states have internal predecessors, (158), 16 states have call successors, (59), 7 states have call predecessors, (59), 12 states have return successors, (61), 19 states have call predecessors, (61), 16 states have call successors, (61) [2022-07-14 04:39:25,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:25,095 INFO L93 Difference]: Finished difference Result 1123 states and 1243 transitions. [2022-07-14 04:39:25,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-14 04:39:25,096 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 44 states have (on average 3.590909090909091) internal successors, (158), 35 states have internal predecessors, (158), 16 states have call successors, (59), 7 states have call predecessors, (59), 12 states have return successors, (61), 19 states have call predecessors, (61), 16 states have call successors, (61) Word has length 156 [2022-07-14 04:39:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:25,098 INFO L225 Difference]: With dead ends: 1123 [2022-07-14 04:39:25,098 INFO L226 Difference]: Without dead ends: 887 [2022-07-14 04:39:25,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 331 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=484, Invalid=4918, Unknown=0, NotChecked=0, Total=5402 [2022-07-14 04:39:25,100 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 1389 mSDsluCounter, 2981 mSDsCounter, 0 mSdLazyCounter, 7637 mSolverCounterSat, 950 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 3282 SdHoareTripleChecker+Invalid, 8587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 950 IncrementalHoareTripleChecker+Valid, 7637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:25,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 3282 Invalid, 8587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [950 Valid, 7637 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-14 04:39:25,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-07-14 04:39:25,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 878. [2022-07-14 04:39:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 574 states have (on average 1.1184668989547037) internal successors, (642), 604 states have internal predecessors, (642), 173 states have call successors, (173), 111 states have call predecessors, (173), 111 states have return successors, (176), 166 states have call predecessors, (176), 171 states have call successors, (176) [2022-07-14 04:39:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 991 transitions. [2022-07-14 04:39:25,248 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 991 transitions. Word has length 156 [2022-07-14 04:39:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:25,248 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 991 transitions. [2022-07-14 04:39:25,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 44 states have (on average 3.590909090909091) internal successors, (158), 35 states have internal predecessors, (158), 16 states have call successors, (59), 7 states have call predecessors, (59), 12 states have return successors, (61), 19 states have call predecessors, (61), 16 states have call successors, (61) [2022-07-14 04:39:25,249 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 991 transitions. [2022-07-14 04:39:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-14 04:39:25,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:25,251 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:25,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 04:39:25,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 04:39:25,460 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:39:25,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:25,461 INFO L85 PathProgramCache]: Analyzing trace with hash -982153904, now seen corresponding path program 1 times [2022-07-14 04:39:25,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:25,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986687091] [2022-07-14 04:39:25,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:25,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:25,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:25,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:39:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:25,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:25,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:39:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:25,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:39:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:25,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:39:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:25,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:39:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:25,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:39:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:25,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:39:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:25,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:39:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:25,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:25,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:25,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:39:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:25,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:39:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:39:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:39:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 04:39:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:39:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:39:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:39:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 04:39:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 04:39:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-14 04:39:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-14 04:39:26,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:26,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986687091] [2022-07-14 04:39:26,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986687091] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:39:26,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534992529] [2022-07-14 04:39:26,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:26,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:39:26,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:39:26,096 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 04:39:26,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 04:39:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 1916 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-14 04:39:26,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:39:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 57 proven. 13 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-14 04:39:27,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:39:28,292 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-14 04:39:28,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534992529] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:39:28,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 04:39:28,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 21] total 51 [2022-07-14 04:39:28,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897234772] [2022-07-14 04:39:28,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 04:39:28,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-14 04:39:28,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:28,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-14 04:39:28,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2399, Unknown=0, NotChecked=0, Total=2550 [2022-07-14 04:39:28,295 INFO L87 Difference]: Start difference. First operand 878 states and 991 transitions. Second operand has 51 states, 43 states have (on average 3.511627906976744) internal successors, (151), 35 states have internal predecessors, (151), 15 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (52), 20 states have call predecessors, (52), 15 states have call successors, (52) [2022-07-14 04:39:32,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:32,741 INFO L93 Difference]: Finished difference Result 1134 states and 1269 transitions. [2022-07-14 04:39:32,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 04:39:32,741 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 3.511627906976744) internal successors, (151), 35 states have internal predecessors, (151), 15 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (52), 20 states have call predecessors, (52), 15 states have call successors, (52) Word has length 158 [2022-07-14 04:39:32,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:32,752 INFO L225 Difference]: With dead ends: 1134 [2022-07-14 04:39:32,752 INFO L226 Difference]: Without dead ends: 877 [2022-07-14 04:39:32,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 330 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=444, Invalid=5106, Unknown=0, NotChecked=0, Total=5550 [2022-07-14 04:39:32,769 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 1149 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 7863 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 2917 SdHoareTripleChecker+Invalid, 8731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 7863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:32,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 2917 Invalid, 8731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 7863 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-14 04:39:32,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2022-07-14 04:39:32,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 876. [2022-07-14 04:39:33,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 572 states have (on average 1.117132867132867) internal successors, (639), 602 states have internal predecessors, (639), 173 states have call successors, (173), 111 states have call predecessors, (173), 111 states have return successors, (176), 166 states have call predecessors, (176), 171 states have call successors, (176) [2022-07-14 04:39:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 988 transitions. [2022-07-14 04:39:33,028 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 988 transitions. Word has length 158 [2022-07-14 04:39:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:33,028 INFO L495 AbstractCegarLoop]: Abstraction has 876 states and 988 transitions. [2022-07-14 04:39:33,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 3.511627906976744) internal successors, (151), 35 states have internal predecessors, (151), 15 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (52), 20 states have call predecessors, (52), 15 states have call successors, (52) [2022-07-14 04:39:33,029 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 988 transitions. [2022-07-14 04:39:33,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-14 04:39:33,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:33,031 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 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] [2022-07-14 04:39:33,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 04:39:33,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:39:33,242 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:39:33,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:33,242 INFO L85 PathProgramCache]: Analyzing trace with hash 350553155, now seen corresponding path program 1 times [2022-07-14 04:39:33,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:33,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968949478] [2022-07-14 04:39:33,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:33,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:39:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:39:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:39:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-14 04:39:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:39:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:39:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:39:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:39:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:39:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:39:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:39:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:39:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 04:39:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:39:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:39:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:39:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:39:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-14 04:39:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-14 04:39:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:39:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-14 04:39:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-07-14 04:39:33,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:33,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968949478] [2022-07-14 04:39:33,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968949478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:33,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:33,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 04:39:33,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801758783] [2022-07-14 04:39:33,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:33,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 04:39:33,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:33,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 04:39:33,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:39:33,391 INFO L87 Difference]: Start difference. First operand 876 states and 988 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-14 04:39:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:34,749 INFO L93 Difference]: Finished difference Result 1424 states and 1665 transitions. [2022-07-14 04:39:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 04:39:34,749 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 187 [2022-07-14 04:39:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:34,753 INFO L225 Difference]: With dead ends: 1424 [2022-07-14 04:39:34,753 INFO L226 Difference]: Without dead ends: 1020 [2022-07-14 04:39:34,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-07-14 04:39:34,755 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 695 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 2054 mSolverCounterSat, 573 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 573 IncrementalHoareTripleChecker+Valid, 2054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:34,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1786 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [573 Valid, 2054 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-14 04:39:34,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2022-07-14 04:39:34,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 876. [2022-07-14 04:39:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 572 states have (on average 1.1136363636363635) internal successors, (637), 602 states have internal predecessors, (637), 173 states have call successors, (173), 111 states have call predecessors, (173), 111 states have return successors, (176), 166 states have call predecessors, (176), 171 states have call successors, (176) [2022-07-14 04:39:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 986 transitions. [2022-07-14 04:39:34,933 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 986 transitions. Word has length 187 [2022-07-14 04:39:34,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:34,934 INFO L495 AbstractCegarLoop]: Abstraction has 876 states and 986 transitions. [2022-07-14 04:39:34,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-14 04:39:34,934 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 986 transitions. [2022-07-14 04:39:34,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-14 04:39:34,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:34,936 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 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] [2022-07-14 04:39:34,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 04:39:34,936 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:39:34,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:34,937 INFO L85 PathProgramCache]: Analyzing trace with hash -241695337, now seen corresponding path program 1 times [2022-07-14 04:39:34,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:34,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900541691] [2022-07-14 04:39:34,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:34,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:39:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:39:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:39:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-14 04:39:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:39:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:39:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:39:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:39:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:39:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:39:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:39:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:39:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:39:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-14 04:39:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 04:39:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:39:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 04:39:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:39:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-14 04:39:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-14 04:39:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:39:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-14 04:39:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-14 04:39:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 04:39:35,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:35,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900541691] [2022-07-14 04:39:35,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900541691] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:39:35,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786478346] [2022-07-14 04:39:35,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:35,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:39:35,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:39:35,212 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 04:39:35,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 04:39:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 2044 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 04:39:35,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:39:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-07-14 04:39:35,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:39:35,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786478346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:35,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:39:35,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 11 [2022-07-14 04:39:35,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84295450] [2022-07-14 04:39:35,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:35,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 04:39:35,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:35,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 04:39:35,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-14 04:39:35,618 INFO L87 Difference]: Start difference. First operand 876 states and 986 transitions. Second operand has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2022-07-14 04:39:35,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:35,857 INFO L93 Difference]: Finished difference Result 1048 states and 1152 transitions. [2022-07-14 04:39:35,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:35,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 198 [2022-07-14 04:39:35,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:35,860 INFO L225 Difference]: With dead ends: 1048 [2022-07-14 04:39:35,860 INFO L226 Difference]: Without dead ends: 684 [2022-07-14 04:39:35,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:39:35,861 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 2 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:35,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2208 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 04:39:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-07-14 04:39:36,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2022-07-14 04:39:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 443 states have (on average 1.1264108352144468) internal successors, (499), 469 states have internal predecessors, (499), 134 states have call successors, (134), 88 states have call predecessors, (134), 87 states have return successors, (136), 128 states have call predecessors, (136), 132 states have call successors, (136) [2022-07-14 04:39:36,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 769 transitions. [2022-07-14 04:39:36,013 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 769 transitions. Word has length 198 [2022-07-14 04:39:36,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:36,013 INFO L495 AbstractCegarLoop]: Abstraction has 684 states and 769 transitions. [2022-07-14 04:39:36,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2022-07-14 04:39:36,014 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 769 transitions. [2022-07-14 04:39:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-14 04:39:36,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:36,015 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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] [2022-07-14 04:39:36,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 04:39:36,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:39:36,248 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:39:36,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:36,248 INFO L85 PathProgramCache]: Analyzing trace with hash -356239818, now seen corresponding path program 1 times [2022-07-14 04:39:36,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:36,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523547703] [2022-07-14 04:39:36,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:36,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:39:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:39:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:39:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:39:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:39:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:39:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:39:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:39:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:39:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:39:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:39:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:39:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:39:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:39:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:39:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-14 04:39:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-14 04:39:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-14 04:39:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-14 04:39:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:39:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-14 04:39:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:39:36,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:36,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523547703] [2022-07-14 04:39:36,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523547703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:36,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:36,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-14 04:39:36,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121905587] [2022-07-14 04:39:36,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:36,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-14 04:39:36,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:36,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 04:39:36,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2022-07-14 04:39:36,845 INFO L87 Difference]: Start difference. First operand 684 states and 769 transitions. Second operand has 21 states, 18 states have (on average 5.166666666666667) internal successors, (93), 15 states have internal predecessors, (93), 9 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2022-07-14 04:39:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:39,668 INFO L93 Difference]: Finished difference Result 1408 states and 1672 transitions. [2022-07-14 04:39:39,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 04:39:39,668 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 5.166666666666667) internal successors, (93), 15 states have internal predecessors, (93), 9 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) Word has length 206 [2022-07-14 04:39:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:39,687 INFO L225 Difference]: With dead ends: 1408 [2022-07-14 04:39:39,688 INFO L226 Difference]: Without dead ends: 878 [2022-07-14 04:39:39,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2022-07-14 04:39:39,704 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 1329 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 4815 mSolverCounterSat, 1510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 6325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1510 IncrementalHoareTripleChecker+Valid, 4815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:39,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1989 Invalid, 6325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1510 Valid, 4815 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-14 04:39:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-07-14 04:39:39,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 690. [2022-07-14 04:39:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 445 states have (on average 1.1213483146067416) internal successors, (499), 473 states have internal predecessors, (499), 136 states have call successors, (136), 88 states have call predecessors, (136), 89 states have return successors, (140), 130 states have call predecessors, (140), 134 states have call successors, (140) [2022-07-14 04:39:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 775 transitions. [2022-07-14 04:39:39,932 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 775 transitions. Word has length 206 [2022-07-14 04:39:39,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:39,932 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 775 transitions. [2022-07-14 04:39:39,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 5.166666666666667) internal successors, (93), 15 states have internal predecessors, (93), 9 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2022-07-14 04:39:39,933 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 775 transitions. [2022-07-14 04:39:39,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-14 04:39:39,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:39,934 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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] [2022-07-14 04:39:39,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 04:39:39,935 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:39:39,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:39,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1497570482, now seen corresponding path program 1 times [2022-07-14 04:39:39,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:39,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46363125] [2022-07-14 04:39:39,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:39,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:39:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:39:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:39:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:39:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:39:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:39:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:39:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:39:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:39:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:39:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:39:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:39:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:39:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:39:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-14 04:39:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:39:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 04:39:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-14 04:39:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-14 04:39:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-14 04:39:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:40,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-14 04:39:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:41,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:41,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-14 04:39:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:41,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:41,154 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2022-07-14 04:39:41,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:41,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46363125] [2022-07-14 04:39:41,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46363125] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:39:41,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595871465] [2022-07-14 04:39:41,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:41,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:39:41,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:39:41,157 INFO L229 MonitoredProcess]: Starting monitored process 9 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:39:41,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 04:39:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:41,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 2160 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-14 04:39:41,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:39:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-07-14 04:39:42,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:39:42,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595871465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:42,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:39:42,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [27] total 44 [2022-07-14 04:39:42,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758960445] [2022-07-14 04:39:42,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:42,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 04:39:42,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:42,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 04:39:42,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1795, Unknown=0, NotChecked=0, Total=1892 [2022-07-14 04:39:42,059 INFO L87 Difference]: Start difference. First operand 690 states and 775 transitions. Second operand has 19 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 8 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2022-07-14 04:39:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:43,027 INFO L93 Difference]: Finished difference Result 960 states and 1070 transitions. [2022-07-14 04:39:43,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-14 04:39:43,027 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 8 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 215 [2022-07-14 04:39:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:43,031 INFO L225 Difference]: With dead ends: 960 [2022-07-14 04:39:43,031 INFO L226 Difference]: Without dead ends: 708 [2022-07-14 04:39:43,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=357, Invalid=3675, Unknown=0, NotChecked=0, Total=4032 [2022-07-14 04:39:43,049 INFO L413 NwaCegarLoop]: 456 mSDtfsCounter, 119 mSDsluCounter, 7043 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 7499 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:43,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 7499 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 04:39:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-07-14 04:39:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 677. [2022-07-14 04:39:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 438 states have (on average 1.1118721461187215) internal successors, (487), 465 states have internal predecessors, (487), 131 states have call successors, (131), 85 states have call predecessors, (131), 89 states have return successors, (135), 128 states have call predecessors, (135), 129 states have call successors, (135) [2022-07-14 04:39:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 753 transitions. [2022-07-14 04:39:43,236 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 753 transitions. Word has length 215 [2022-07-14 04:39:43,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:43,251 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 753 transitions. [2022-07-14 04:39:43,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 8 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2022-07-14 04:39:43,252 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 753 transitions. [2022-07-14 04:39:43,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-14 04:39:43,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:43,254 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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] [2022-07-14 04:39:43,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 04:39:43,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-14 04:39:43,455 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:39:43,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:43,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1299940040, now seen corresponding path program 1 times [2022-07-14 04:39:43,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:43,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249037390] [2022-07-14 04:39:43,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:43,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:39:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:39:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:39:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:39:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:39:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:39:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:39:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:39:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:39:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:39:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:39:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:39:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:39:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 04:39:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:39:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-14 04:39:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 04:39:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-14 04:39:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-14 04:39:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 04:39:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:39:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:43,608 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:39:43,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:43,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249037390] [2022-07-14 04:39:43,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249037390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:43,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:43,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:39:43,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502823075] [2022-07-14 04:39:43,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:43,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:39:43,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:43,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:39:43,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:39:43,610 INFO L87 Difference]: Start difference. First operand 677 states and 753 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-14 04:39:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:44,320 INFO L93 Difference]: Finished difference Result 714 states and 773 transitions. [2022-07-14 04:39:44,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 04:39:44,320 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 210 [2022-07-14 04:39:44,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:44,323 INFO L225 Difference]: With dead ends: 714 [2022-07-14 04:39:44,323 INFO L226 Difference]: Without dead ends: 712 [2022-07-14 04:39:44,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-07-14 04:39:44,324 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 1461 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:44,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 875 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 04:39:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-07-14 04:39:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 675. [2022-07-14 04:39:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 437 states have (on average 1.1098398169336385) internal successors, (485), 463 states have internal predecessors, (485), 131 states have call successors, (131), 85 states have call predecessors, (131), 89 states have return successors, (135), 128 states have call predecessors, (135), 129 states have call successors, (135) [2022-07-14 04:39:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 751 transitions. [2022-07-14 04:39:44,494 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 751 transitions. Word has length 210 [2022-07-14 04:39:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:44,494 INFO L495 AbstractCegarLoop]: Abstraction has 675 states and 751 transitions. [2022-07-14 04:39:44,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-14 04:39:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 751 transitions. [2022-07-14 04:39:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-14 04:39:44,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:44,496 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:39:44,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 04:39:44,496 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:39:44,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:44,497 INFO L85 PathProgramCache]: Analyzing trace with hash -600142417, now seen corresponding path program 1 times [2022-07-14 04:39:44,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:44,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121299932] [2022-07-14 04:39:44,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:44,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:44,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:44,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:39:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:39:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:39:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:39:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:39:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:39:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:39:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:39:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:39:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:39:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:39:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:39:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:39:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:39:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-14 04:39:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:39:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 04:39:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-14 04:39:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-14 04:39:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-14 04:39:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-14 04:39:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-14 04:39:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-14 04:39:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-14 04:39:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-14 04:39:45,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:45,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121299932] [2022-07-14 04:39:45,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121299932] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:39:45,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766587561] [2022-07-14 04:39:45,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:45,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:39:45,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:39:45,476 INFO L229 MonitoredProcess]: Starting monitored process 10 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:39:45,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 04:39:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 2096 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-14 04:39:45,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:39:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 153 proven. 21 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-14 04:39:46,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:39:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-14 04:39:46,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766587561] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:39:46,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 04:39:46,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 15] total 33 [2022-07-14 04:39:46,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477226063] [2022-07-14 04:39:46,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 04:39:46,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-14 04:39:46,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:46,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-14 04:39:46,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2022-07-14 04:39:46,645 INFO L87 Difference]: Start difference. First operand 675 states and 751 transitions. Second operand has 33 states, 30 states have (on average 6.3) internal successors, (189), 27 states have internal predecessors, (189), 13 states have call successors, (71), 7 states have call predecessors, (71), 8 states have return successors, (68), 14 states have call predecessors, (68), 13 states have call successors, (68) [2022-07-14 04:39:50,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:50,037 INFO L93 Difference]: Finished difference Result 1064 states and 1177 transitions. [2022-07-14 04:39:50,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-14 04:39:50,038 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 6.3) internal successors, (189), 27 states have internal predecessors, (189), 13 states have call successors, (71), 7 states have call predecessors, (71), 8 states have return successors, (68), 14 states have call predecessors, (68), 13 states have call successors, (68) Word has length 214 [2022-07-14 04:39:50,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:50,041 INFO L225 Difference]: With dead ends: 1064 [2022-07-14 04:39:50,041 INFO L226 Difference]: Without dead ends: 687 [2022-07-14 04:39:50,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 479 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=316, Invalid=2546, Unknown=0, NotChecked=0, Total=2862 [2022-07-14 04:39:50,042 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 1216 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 5595 mSolverCounterSat, 1025 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 2466 SdHoareTripleChecker+Invalid, 6620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1025 IncrementalHoareTripleChecker+Valid, 5595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:50,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 2466 Invalid, 6620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1025 Valid, 5595 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-14 04:39:50,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2022-07-14 04:39:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 663. [2022-07-14 04:39:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 431 states have (on average 1.1020881670533642) internal successors, (475), 454 states have internal predecessors, (475), 129 states have call successors, (129), 84 states have call predecessors, (129), 85 states have return successors, (129), 126 states have call predecessors, (129), 127 states have call successors, (129) [2022-07-14 04:39:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 733 transitions. [2022-07-14 04:39:50,249 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 733 transitions. Word has length 214 [2022-07-14 04:39:50,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:50,249 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 733 transitions. [2022-07-14 04:39:50,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 6.3) internal successors, (189), 27 states have internal predecessors, (189), 13 states have call successors, (71), 7 states have call predecessors, (71), 8 states have return successors, (68), 14 states have call predecessors, (68), 13 states have call successors, (68) [2022-07-14 04:39:50,250 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 733 transitions. [2022-07-14 04:39:50,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-07-14 04:39:50,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:50,251 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:39:50,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-14 04:39:50,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-14 04:39:50,470 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:39:50,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:50,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2038632069, now seen corresponding path program 1 times [2022-07-14 04:39:50,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:50,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126125602] [2022-07-14 04:39:50,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:50,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:39:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:39:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:39:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:39:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:39:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:39:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:39:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:39:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:39:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:39:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:39:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:39:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:39:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 04:39:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:39:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-14 04:39:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 04:39:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-14 04:39:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-14 04:39:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 04:39:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-14 04:39:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-14 04:39:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-14 04:39:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-14 04:39:50,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:50,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126125602] [2022-07-14 04:39:50,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126125602] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:39:50,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778960453] [2022-07-14 04:39:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:50,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:39:50,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:39:50,675 INFO L229 MonitoredProcess]: Starting monitored process 11 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:39:50,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 04:39:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:51,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 2070 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-14 04:39:51,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:39:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-14 04:39:51,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:39:51,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778960453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:51,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:39:51,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13] total 24 [2022-07-14 04:39:51,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458271729] [2022-07-14 04:39:51,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:51,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 04:39:51,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:51,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 04:39:51,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2022-07-14 04:39:51,164 INFO L87 Difference]: Start difference. First operand 663 states and 733 transitions. Second operand has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) [2022-07-14 04:39:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:51,646 INFO L93 Difference]: Finished difference Result 820 states and 890 transitions. [2022-07-14 04:39:51,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 04:39:51,647 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) Word has length 209 [2022-07-14 04:39:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:51,667 INFO L225 Difference]: With dead ends: 820 [2022-07-14 04:39:51,667 INFO L226 Difference]: Without dead ends: 665 [2022-07-14 04:39:51,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2022-07-14 04:39:51,668 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 157 mSDsluCounter, 4390 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 4759 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:51,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 4759 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 04:39:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-07-14 04:39:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2022-07-14 04:39:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 431 states have (on average 1.099767981438515) internal successors, (474), 454 states have internal predecessors, (474), 129 states have call successors, (129), 84 states have call predecessors, (129), 85 states have return successors, (129), 126 states have call predecessors, (129), 127 states have call successors, (129) [2022-07-14 04:39:51,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 732 transitions. [2022-07-14 04:39:51,871 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 732 transitions. Word has length 209 [2022-07-14 04:39:51,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:51,872 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 732 transitions. [2022-07-14 04:39:51,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) [2022-07-14 04:39:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 732 transitions. [2022-07-14 04:39:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-14 04:39:51,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:51,874 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:39:51,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-14 04:39:52,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-14 04:39:52,095 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:39:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:52,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1210752770, now seen corresponding path program 1 times [2022-07-14 04:39:52,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:52,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794819736] [2022-07-14 04:39:52,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:52,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:39:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:39:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:39:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:39:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:39:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:39:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:39:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:39:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:39:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:39:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:39:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:39:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:39:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 04:39:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:39:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-14 04:39:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 04:39:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-14 04:39:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-14 04:39:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 04:39:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:39:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:39:52,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:52,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794819736] [2022-07-14 04:39:52,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794819736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:52,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:52,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 04:39:52,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084260096] [2022-07-14 04:39:52,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:52,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 04:39:52,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:52,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 04:39:52,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:39:52,468 INFO L87 Difference]: Start difference. First operand 663 states and 732 transitions. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (31), 5 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-14 04:39:53,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:53,495 INFO L93 Difference]: Finished difference Result 663 states and 732 transitions. [2022-07-14 04:39:53,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 04:39:53,496 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (31), 5 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 213 [2022-07-14 04:39:53,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:53,498 INFO L225 Difference]: With dead ends: 663 [2022-07-14 04:39:53,498 INFO L226 Difference]: Without dead ends: 661 [2022-07-14 04:39:53,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2022-07-14 04:39:53,500 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 928 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:53,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 914 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 04:39:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-07-14 04:39:53,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2022-07-14 04:39:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 430 states have (on average 1.0976744186046512) internal successors, (472), 452 states have internal predecessors, (472), 129 states have call successors, (129), 84 states have call predecessors, (129), 85 states have return successors, (129), 126 states have call predecessors, (129), 127 states have call successors, (129) [2022-07-14 04:39:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 730 transitions. [2022-07-14 04:39:53,678 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 730 transitions. Word has length 213 [2022-07-14 04:39:53,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:53,679 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 730 transitions. [2022-07-14 04:39:53,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (31), 5 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-14 04:39:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 730 transitions. [2022-07-14 04:39:53,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-07-14 04:39:53,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:53,680 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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] [2022-07-14 04:39:53,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 04:39:53,681 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:39:53,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:53,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2056655727, now seen corresponding path program 1 times [2022-07-14 04:39:53,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:53,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892578260] [2022-07-14 04:39:53,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:53,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:39:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:39:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:39:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:39:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:39:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:39:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:39:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:39:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:39:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:39:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:39:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:39:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:39:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:39:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-14 04:39:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-14 04:39:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-14 04:39:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-14 04:39:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-14 04:39:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-14 04:39:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-14 04:39:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-14 04:39:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-14 04:39:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-14 04:39:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-07-14 04:39:54,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:54,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892578260] [2022-07-14 04:39:54,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892578260] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:39:54,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690592633] [2022-07-14 04:39:54,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:54,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:39:54,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:39:54,267 INFO L229 MonitoredProcess]: Starting monitored process 12 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:39:54,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 04:39:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:54,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 2134 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-14 04:39:54,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:39:55,091 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-14 04:39:55,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:39:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-07-14 04:39:55,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690592633] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:39:55,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 04:39:55,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 16] total 43 [2022-07-14 04:39:55,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485970949] [2022-07-14 04:39:55,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 04:39:55,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-14 04:39:55,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:55,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-14 04:39:55,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1682, Unknown=0, NotChecked=0, Total=1806 [2022-07-14 04:39:55,770 INFO L87 Difference]: Start difference. First operand 661 states and 730 transitions. Second operand has 43 states, 40 states have (on average 5.15) internal successors, (206), 32 states have internal predecessors, (206), 15 states have call successors, (75), 7 states have call predecessors, (75), 10 states have return successors, (73), 17 states have call predecessors, (73), 15 states have call successors, (73) [2022-07-14 04:39:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:59,205 INFO L93 Difference]: Finished difference Result 963 states and 1039 transitions. [2022-07-14 04:39:59,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 04:39:59,206 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 5.15) internal successors, (206), 32 states have internal predecessors, (206), 15 states have call successors, (75), 7 states have call predecessors, (75), 10 states have return successors, (73), 17 states have call predecessors, (73), 15 states have call successors, (73) Word has length 226 [2022-07-14 04:39:59,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:59,208 INFO L225 Difference]: With dead ends: 963 [2022-07-14 04:39:59,208 INFO L226 Difference]: Without dead ends: 594 [2022-07-14 04:39:59,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 493 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=397, Invalid=3509, Unknown=0, NotChecked=0, Total=3906 [2022-07-14 04:39:59,211 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 1659 mSDsluCounter, 2413 mSDsCounter, 0 mSdLazyCounter, 5990 mSolverCounterSat, 1300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 7290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1300 IncrementalHoareTripleChecker+Valid, 5990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:59,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 2711 Invalid, 7290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1300 Valid, 5990 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-14 04:39:59,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-07-14 04:39:59,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2022-07-14 04:39:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 385 states have (on average 1.0987012987012987) internal successors, (423), 405 states have internal predecessors, (423), 114 states have call successors, (114), 79 states have call predecessors, (114), 78 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2022-07-14 04:39:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 649 transitions. [2022-07-14 04:39:59,448 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 649 transitions. Word has length 226 [2022-07-14 04:39:59,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:59,448 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 649 transitions. [2022-07-14 04:39:59,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 5.15) internal successors, (206), 32 states have internal predecessors, (206), 15 states have call successors, (75), 7 states have call predecessors, (75), 10 states have return successors, (73), 17 states have call predecessors, (73), 15 states have call successors, (73) [2022-07-14 04:39:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 649 transitions. [2022-07-14 04:39:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-07-14 04:39:59,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:59,450 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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] [2022-07-14 04:39:59,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-14 04:39:59,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-14 04:39:59,672 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:39:59,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:59,673 INFO L85 PathProgramCache]: Analyzing trace with hash 920927049, now seen corresponding path program 1 times [2022-07-14 04:39:59,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:59,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138940653] [2022-07-14 04:39:59,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:59,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:39:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:39:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:39:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:39:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:39:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:39:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:39:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:39:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:39:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:39:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:39:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:39:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:39:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:39:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:39:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:39:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:39:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:39:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:39:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:39:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:39:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:39:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:39:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:39:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:39:59,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:59,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138940653] [2022-07-14 04:39:59,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138940653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:59,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:59,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:39:59,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632512441] [2022-07-14 04:39:59,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:59,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:39:59,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:59,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:39:59,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:39:59,969 INFO L87 Difference]: Start difference. First operand 594 states and 649 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (35), 6 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-14 04:40:00,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:00,773 INFO L93 Difference]: Finished difference Result 594 states and 649 transitions. [2022-07-14 04:40:00,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 04:40:00,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (35), 6 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 229 [2022-07-14 04:40:00,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:00,776 INFO L225 Difference]: With dead ends: 594 [2022-07-14 04:40:00,776 INFO L226 Difference]: Without dead ends: 592 [2022-07-14 04:40:00,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-07-14 04:40:00,796 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 911 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:00,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 754 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 04:40:00,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-07-14 04:40:01,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2022-07-14 04:40:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 384 states have (on average 1.09375) internal successors, (420), 403 states have internal predecessors, (420), 114 states have call successors, (114), 79 states have call predecessors, (114), 78 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2022-07-14 04:40:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 646 transitions. [2022-07-14 04:40:01,109 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 646 transitions. Word has length 229 [2022-07-14 04:40:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:01,109 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 646 transitions. [2022-07-14 04:40:01,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (35), 6 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-14 04:40:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 646 transitions. [2022-07-14 04:40:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-07-14 04:40:01,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:01,111 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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] [2022-07-14 04:40:01,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-14 04:40:01,112 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:40:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash -460235288, now seen corresponding path program 1 times [2022-07-14 04:40:01,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:01,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449932198] [2022-07-14 04:40:01,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:01,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:40:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:40:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:40:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:40:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:40:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:40:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:40:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:40:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:40:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:40:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:40:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:40:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:40:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:40:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:40:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:40:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:40:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:40:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:40:01,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:01,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449932198] [2022-07-14 04:40:01,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449932198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:01,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:01,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:40:01,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68428206] [2022-07-14 04:40:01,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:01,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:40:01,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:01,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:40:01,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:40:01,413 INFO L87 Difference]: Start difference. First operand 592 states and 646 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (36), 6 states have call predecessors, (36), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-14 04:40:02,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:02,466 INFO L93 Difference]: Finished difference Result 627 states and 665 transitions. [2022-07-14 04:40:02,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 04:40:02,466 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (36), 6 states have call predecessors, (36), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 235 [2022-07-14 04:40:02,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:02,469 INFO L225 Difference]: With dead ends: 627 [2022-07-14 04:40:02,469 INFO L226 Difference]: Without dead ends: 625 [2022-07-14 04:40:02,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-07-14 04:40:02,469 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 944 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:02,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 1107 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-14 04:40:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-07-14 04:40:02,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 592. [2022-07-14 04:40:02,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 384 states have (on average 1.0911458333333333) internal successors, (419), 403 states have internal predecessors, (419), 114 states have call successors, (114), 79 states have call predecessors, (114), 78 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2022-07-14 04:40:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 645 transitions. [2022-07-14 04:40:02,642 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 645 transitions. Word has length 235 [2022-07-14 04:40:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:02,642 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 645 transitions. [2022-07-14 04:40:02,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (36), 6 states have call predecessors, (36), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-14 04:40:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 645 transitions. [2022-07-14 04:40:02,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-14 04:40:02,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:02,652 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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] [2022-07-14 04:40:02,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-14 04:40:02,653 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:40:02,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash -622740987, now seen corresponding path program 1 times [2022-07-14 04:40:02,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:02,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638168788] [2022-07-14 04:40:02,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:02,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:40:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:40:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:40:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:40:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:40:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:40:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:40:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:40:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:40:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:40:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:40:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:40:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:40:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:40:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:40:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:40:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:40:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:40:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 04:40:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:40:02,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:02,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638168788] [2022-07-14 04:40:02,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638168788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:02,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:02,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:40:02,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436784418] [2022-07-14 04:40:02,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:02,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:40:02,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:02,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:40:02,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:40:02,875 INFO L87 Difference]: Start difference. First operand 592 states and 645 transitions. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-14 04:40:03,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:03,473 INFO L93 Difference]: Finished difference Result 592 states and 645 transitions. [2022-07-14 04:40:03,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:40:03,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 241 [2022-07-14 04:40:03,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:03,476 INFO L225 Difference]: With dead ends: 592 [2022-07-14 04:40:03,476 INFO L226 Difference]: Without dead ends: 590 [2022-07-14 04:40:03,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 04:40:03,477 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 904 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:03,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 708 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 04:40:03,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-07-14 04:40:03,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2022-07-14 04:40:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 383 states have (on average 1.0861618798955615) internal successors, (416), 401 states have internal predecessors, (416), 114 states have call successors, (114), 79 states have call predecessors, (114), 78 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2022-07-14 04:40:03,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 642 transitions. [2022-07-14 04:40:03,624 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 642 transitions. Word has length 241 [2022-07-14 04:40:03,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:03,625 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 642 transitions. [2022-07-14 04:40:03,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-14 04:40:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 642 transitions. [2022-07-14 04:40:03,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-14 04:40:03,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:03,626 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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] [2022-07-14 04:40:03,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-14 04:40:03,627 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:40:03,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:03,627 INFO L85 PathProgramCache]: Analyzing trace with hash 433711426, now seen corresponding path program 1 times [2022-07-14 04:40:03,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:03,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853582428] [2022-07-14 04:40:03,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:03,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:40:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:40:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:40:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:40:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:40:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:40:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:40:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:40:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 04:40:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 04:40:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:40:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-14 04:40:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-14 04:40:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-14 04:40:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:40:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:40:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:40:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:40:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:40:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 04:40:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:40:03,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:03,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853582428] [2022-07-14 04:40:03,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853582428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:03,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:03,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 04:40:03,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103525294] [2022-07-14 04:40:03,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:03,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 04:40:03,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:03,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 04:40:03,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-14 04:40:03,792 INFO L87 Difference]: Start difference. First operand 590 states and 642 transitions. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 7 states have internal predecessors, (116), 4 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2022-07-14 04:40:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:04,466 INFO L93 Difference]: Finished difference Result 647 states and 684 transitions. [2022-07-14 04:40:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 04:40:04,466 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 7 states have internal predecessors, (116), 4 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 241 [2022-07-14 04:40:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:04,477 INFO L225 Difference]: With dead ends: 647 [2022-07-14 04:40:04,477 INFO L226 Difference]: Without dead ends: 436 [2022-07-14 04:40:04,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-07-14 04:40:04,478 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 777 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:04,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1103 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 04:40:04,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-07-14 04:40:04,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2022-07-14 04:40:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 281 states have (on average 1.0640569395017794) internal successors, (299), 297 states have internal predecessors, (299), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-14 04:40:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 471 transitions. [2022-07-14 04:40:04,584 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 471 transitions. Word has length 241 [2022-07-14 04:40:04,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:04,584 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 471 transitions. [2022-07-14 04:40:04,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 7 states have internal predecessors, (116), 4 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2022-07-14 04:40:04,584 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 471 transitions. [2022-07-14 04:40:04,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-07-14 04:40:04,585 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:04,586 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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] [2022-07-14 04:40:04,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-14 04:40:04,586 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:40:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:04,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1683504449, now seen corresponding path program 1 times [2022-07-14 04:40:04,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:04,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762985946] [2022-07-14 04:40:04,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:04,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:40:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:40:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:40:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:40:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:40:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:40:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:40:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:40:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:40:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:40:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:40:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:40:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:40:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:40:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:40:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:40:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:40:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:40:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 04:40:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-14 04:40:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:40:04,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:04,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762985946] [2022-07-14 04:40:04,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762985946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:04,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:04,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:40:04,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586843805] [2022-07-14 04:40:04,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:04,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:40:04,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:04,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:40:04,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:40:04,763 INFO L87 Difference]: Start difference. First operand 436 states and 471 transitions. Second operand has 8 states, 8 states have (on average 15.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2022-07-14 04:40:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:05,171 INFO L93 Difference]: Finished difference Result 436 states and 471 transitions. [2022-07-14 04:40:05,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:40:05,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 247 [2022-07-14 04:40:05,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:05,173 INFO L225 Difference]: With dead ends: 436 [2022-07-14 04:40:05,173 INFO L226 Difference]: Without dead ends: 434 [2022-07-14 04:40:05,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 04:40:05,174 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 888 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:05,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 704 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 04:40:05,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-07-14 04:40:05,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-07-14 04:40:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 280 states have (on average 1.0607142857142857) internal successors, (297), 295 states have internal predecessors, (297), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-14 04:40:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 469 transitions. [2022-07-14 04:40:05,299 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 469 transitions. Word has length 247 [2022-07-14 04:40:05,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:05,299 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 469 transitions. [2022-07-14 04:40:05,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2022-07-14 04:40:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 469 transitions. [2022-07-14 04:40:05,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-07-14 04:40:05,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:05,301 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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] [2022-07-14 04:40:05,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-14 04:40:05,302 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:40:05,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:05,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1354751516, now seen corresponding path program 1 times [2022-07-14 04:40:05,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:05,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080930577] [2022-07-14 04:40:05,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:05,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:40:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:40:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:40:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:40:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:40:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:40:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:40:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:40:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:40:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:40:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:40:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:40:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:40:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:40:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:40:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:40:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:40:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:40:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 04:40:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-14 04:40:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:40:05,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:05,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080930577] [2022-07-14 04:40:05,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080930577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:05,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:05,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:40:05,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747314970] [2022-07-14 04:40:05,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:05,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:40:05,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:05,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:40:05,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:40:05,570 INFO L87 Difference]: Start difference. First operand 434 states and 469 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2022-07-14 04:40:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:06,185 INFO L93 Difference]: Finished difference Result 434 states and 469 transitions. [2022-07-14 04:40:06,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:40:06,185 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 249 [2022-07-14 04:40:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:06,187 INFO L225 Difference]: With dead ends: 434 [2022-07-14 04:40:06,187 INFO L226 Difference]: Without dead ends: 432 [2022-07-14 04:40:06,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 04:40:06,187 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 872 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:06,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 702 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 04:40:06,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-07-14 04:40:06,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2022-07-14 04:40:06,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 279 states have (on average 1.0573476702508962) internal successors, (295), 293 states have internal predecessors, (295), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-14 04:40:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 467 transitions. [2022-07-14 04:40:06,308 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 467 transitions. Word has length 249 [2022-07-14 04:40:06,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:06,308 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 467 transitions. [2022-07-14 04:40:06,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2022-07-14 04:40:06,309 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 467 transitions. [2022-07-14 04:40:06,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-07-14 04:40:06,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:06,310 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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] [2022-07-14 04:40:06,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-14 04:40:06,310 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:40:06,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:06,311 INFO L85 PathProgramCache]: Analyzing trace with hash -43862279, now seen corresponding path program 1 times [2022-07-14 04:40:06,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:06,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237519132] [2022-07-14 04:40:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:06,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:40:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:40:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:40:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:40:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:40:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:40:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:40:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:40:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:40:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:40:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:40:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:40:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:40:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:40:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:40:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:40:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:40:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:40:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 04:40:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-14 04:40:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-14 04:40:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:40:06,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:06,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237519132] [2022-07-14 04:40:06,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237519132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:06,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:06,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:40:06,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134403643] [2022-07-14 04:40:06,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:06,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:40:06,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:06,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:40:06,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:40:06,572 INFO L87 Difference]: Start difference. First operand 432 states and 467 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-14 04:40:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:07,204 INFO L93 Difference]: Finished difference Result 432 states and 467 transitions. [2022-07-14 04:40:07,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:40:07,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 255 [2022-07-14 04:40:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:07,206 INFO L225 Difference]: With dead ends: 432 [2022-07-14 04:40:07,206 INFO L226 Difference]: Without dead ends: 430 [2022-07-14 04:40:07,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 04:40:07,207 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 864 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:07,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 700 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 04:40:07,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-07-14 04:40:07,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2022-07-14 04:40:07,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 278 states have (on average 1.0539568345323742) internal successors, (293), 291 states have internal predecessors, (293), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-14 04:40:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 465 transitions. [2022-07-14 04:40:07,315 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 465 transitions. Word has length 255 [2022-07-14 04:40:07,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:07,315 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 465 transitions. [2022-07-14 04:40:07,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-14 04:40:07,316 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 465 transitions. [2022-07-14 04:40:07,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2022-07-14 04:40:07,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:07,317 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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] [2022-07-14 04:40:07,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-14 04:40:07,317 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:40:07,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:07,318 INFO L85 PathProgramCache]: Analyzing trace with hash 312603938, now seen corresponding path program 1 times [2022-07-14 04:40:07,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:07,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595794198] [2022-07-14 04:40:07,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:07,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:40:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:40:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:40:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:40:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:40:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:40:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:40:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:40:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:40:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:40:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:40:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:40:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:40:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:40:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:40:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:40:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:40:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:40:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 04:40:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-14 04:40:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-14 04:40:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-14 04:40:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:40:07,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:07,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595794198] [2022-07-14 04:40:07,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595794198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:07,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:07,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:40:07,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565884471] [2022-07-14 04:40:07,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:07,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:40:07,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:07,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:40:07,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:40:07,528 INFO L87 Difference]: Start difference. First operand 430 states and 465 transitions. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (40), 6 states have call predecessors, (40), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2022-07-14 04:40:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:08,124 INFO L93 Difference]: Finished difference Result 430 states and 465 transitions. [2022-07-14 04:40:08,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:40:08,125 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (40), 6 states have call predecessors, (40), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 261 [2022-07-14 04:40:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:08,126 INFO L225 Difference]: With dead ends: 430 [2022-07-14 04:40:08,126 INFO L226 Difference]: Without dead ends: 428 [2022-07-14 04:40:08,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 04:40:08,127 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 854 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:08,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 698 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 04:40:08,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-07-14 04:40:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2022-07-14 04:40:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 277 states have (on average 1.0505415162454874) internal successors, (291), 289 states have internal predecessors, (291), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-14 04:40:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 463 transitions. [2022-07-14 04:40:08,252 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 463 transitions. Word has length 261 [2022-07-14 04:40:08,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:08,252 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 463 transitions. [2022-07-14 04:40:08,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (40), 6 states have call predecessors, (40), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2022-07-14 04:40:08,253 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 463 transitions. [2022-07-14 04:40:08,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-14 04:40:08,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:08,254 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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:40:08,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-14 04:40:08,255 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:40:08,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:08,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1168433669, now seen corresponding path program 1 times [2022-07-14 04:40:08,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:08,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817881023] [2022-07-14 04:40:08,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:08,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:40:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:40:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:40:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:40:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:40:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:40:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:40:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:40:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:40:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:40:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:40:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:40:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:40:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:40:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:40:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:40:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:40:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:40:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 04:40:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-14 04:40:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-14 04:40:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-14 04:40:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-14 04:40:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,438 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:40:08,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:08,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817881023] [2022-07-14 04:40:08,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817881023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:08,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:08,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:40:08,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382765619] [2022-07-14 04:40:08,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:08,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:40:08,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:08,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:40:08,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:40:08,440 INFO L87 Difference]: Start difference. First operand 428 states and 463 transitions. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 4 states have internal predecessors, (134), 2 states have call successors, (41), 6 states have call predecessors, (41), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-14 04:40:08,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:08,982 INFO L93 Difference]: Finished difference Result 428 states and 463 transitions. [2022-07-14 04:40:08,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:40:08,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 4 states have internal predecessors, (134), 2 states have call successors, (41), 6 states have call predecessors, (41), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 267 [2022-07-14 04:40:08,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:08,984 INFO L225 Difference]: With dead ends: 428 [2022-07-14 04:40:08,984 INFO L226 Difference]: Without dead ends: 426 [2022-07-14 04:40:08,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 04:40:08,985 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 844 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:08,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 696 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 04:40:08,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-07-14 04:40:09,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2022-07-14 04:40:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 276 states have (on average 1.0471014492753623) internal successors, (289), 287 states have internal predecessors, (289), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-14 04:40:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 461 transitions. [2022-07-14 04:40:09,094 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 461 transitions. Word has length 267 [2022-07-14 04:40:09,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:09,094 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 461 transitions. [2022-07-14 04:40:09,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 4 states have internal predecessors, (134), 2 states have call successors, (41), 6 states have call predecessors, (41), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-14 04:40:09,094 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 461 transitions. [2022-07-14 04:40:09,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-07-14 04:40:09,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:09,096 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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] [2022-07-14 04:40:09,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-14 04:40:09,096 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:40:09,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:09,096 INFO L85 PathProgramCache]: Analyzing trace with hash -645970940, now seen corresponding path program 1 times [2022-07-14 04:40:09,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:09,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089580992] [2022-07-14 04:40:09,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:09,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:40:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:40:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:40:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:40:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:40:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:40:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:40:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:40:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:40:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:40:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:40:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:40:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:40:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:40:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:40:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:40:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:40:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:40:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 04:40:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-14 04:40:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-14 04:40:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-14 04:40:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-14 04:40:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-14 04:40:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:40:09,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:09,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089580992] [2022-07-14 04:40:09,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089580992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:09,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:09,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:40:09,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215345888] [2022-07-14 04:40:09,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:09,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:40:09,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:09,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:40:09,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:40:09,286 INFO L87 Difference]: Start difference. First operand 426 states and 461 transitions. Second operand has 8 states, 8 states have (on average 17.25) internal successors, (138), 4 states have internal predecessors, (138), 2 states have call successors, (42), 6 states have call predecessors, (42), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-14 04:40:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:09,898 INFO L93 Difference]: Finished difference Result 426 states and 461 transitions. [2022-07-14 04:40:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:40:09,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.25) internal successors, (138), 4 states have internal predecessors, (138), 2 states have call successors, (42), 6 states have call predecessors, (42), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 273 [2022-07-14 04:40:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:09,900 INFO L225 Difference]: With dead ends: 426 [2022-07-14 04:40:09,900 INFO L226 Difference]: Without dead ends: 424 [2022-07-14 04:40:09,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 04:40:09,901 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 834 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:09,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 694 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 04:40:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-07-14 04:40:10,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2022-07-14 04:40:10,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 275 states have (on average 1.0436363636363637) internal successors, (287), 285 states have internal predecessors, (287), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-14 04:40:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 459 transitions. [2022-07-14 04:40:10,020 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 459 transitions. Word has length 273 [2022-07-14 04:40:10,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:10,020 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 459 transitions. [2022-07-14 04:40:10,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.25) internal successors, (138), 4 states have internal predecessors, (138), 2 states have call successors, (42), 6 states have call predecessors, (42), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-14 04:40:10,021 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 459 transitions. [2022-07-14 04:40:10,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-14 04:40:10,022 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:10,022 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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] [2022-07-14 04:40:10,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-14 04:40:10,022 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:40:10,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:10,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2010354461, now seen corresponding path program 1 times [2022-07-14 04:40:10,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:10,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321760972] [2022-07-14 04:40:10,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:10,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:40:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:40:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:40:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:40:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:40:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:40:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:40:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:40:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:40:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:40:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:40:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:40:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:40:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:40:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:40:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:40:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:40:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:40:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 04:40:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-14 04:40:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-14 04:40:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-14 04:40:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-14 04:40:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-14 04:40:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-14 04:40:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:40:10,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:10,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321760972] [2022-07-14 04:40:10,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321760972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:10,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:10,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:40:10,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948604271] [2022-07-14 04:40:10,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:10,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:40:10,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:10,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:40:10,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:40:10,224 INFO L87 Difference]: Start difference. First operand 424 states and 459 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (43), 6 states have call predecessors, (43), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-14 04:40:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:10,822 INFO L93 Difference]: Finished difference Result 424 states and 459 transitions. [2022-07-14 04:40:10,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:40:10,822 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (43), 6 states have call predecessors, (43), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 279 [2022-07-14 04:40:10,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:10,830 INFO L225 Difference]: With dead ends: 424 [2022-07-14 04:40:10,831 INFO L226 Difference]: Without dead ends: 422 [2022-07-14 04:40:10,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 04:40:10,835 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 824 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:10,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 692 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 04:40:10,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-07-14 04:40:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2022-07-14 04:40:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 274 states have (on average 1.0401459854014599) internal successors, (285), 283 states have internal predecessors, (285), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-14 04:40:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 457 transitions. [2022-07-14 04:40:10,962 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 457 transitions. Word has length 279 [2022-07-14 04:40:10,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:10,962 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 457 transitions. [2022-07-14 04:40:10,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (43), 6 states have call predecessors, (43), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-14 04:40:10,963 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 457 transitions. [2022-07-14 04:40:10,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2022-07-14 04:40:10,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:10,964 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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] [2022-07-14 04:40:10,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-14 04:40:10,964 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:40:10,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:10,965 INFO L85 PathProgramCache]: Analyzing trace with hash -448659565, now seen corresponding path program 1 times [2022-07-14 04:40:10,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:10,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8585355] [2022-07-14 04:40:10,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:10,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:40:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:40:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:40:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:40:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:40:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:40:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:40:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:40:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:40:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:40:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:40:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:40:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:40:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:40:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:40:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:40:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:40:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:40:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 04:40:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-14 04:40:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-14 04:40:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-14 04:40:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-14 04:40:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-14 04:40:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-14 04:40:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-14 04:40:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:40:11,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:11,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8585355] [2022-07-14 04:40:11,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8585355] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:11,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:11,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:40:11,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181592662] [2022-07-14 04:40:11,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:11,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:40:11,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:11,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:40:11,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:40:11,279 INFO L87 Difference]: Start difference. First operand 422 states and 457 transitions. Second operand has 8 states, 8 states have (on average 18.25) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (44), 6 states have call predecessors, (44), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2022-07-14 04:40:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:12,074 INFO L93 Difference]: Finished difference Result 422 states and 457 transitions. [2022-07-14 04:40:12,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:40:12,074 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (44), 6 states have call predecessors, (44), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 285 [2022-07-14 04:40:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:12,076 INFO L225 Difference]: With dead ends: 422 [2022-07-14 04:40:12,076 INFO L226 Difference]: Without dead ends: 420 [2022-07-14 04:40:12,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 04:40:12,083 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 814 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:12,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 690 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 04:40:12,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-07-14 04:40:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2022-07-14 04:40:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 273 states have (on average 1.0366300366300367) internal successors, (283), 281 states have internal predecessors, (283), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-14 04:40:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 455 transitions. [2022-07-14 04:40:12,281 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 455 transitions. Word has length 285 [2022-07-14 04:40:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:12,281 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 455 transitions. [2022-07-14 04:40:12,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (44), 6 states have call predecessors, (44), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2022-07-14 04:40:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 455 transitions. [2022-07-14 04:40:12,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2022-07-14 04:40:12,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:12,283 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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] [2022-07-14 04:40:12,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-14 04:40:12,283 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:40:12,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:12,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2024722807, now seen corresponding path program 1 times [2022-07-14 04:40:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:12,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550489188] [2022-07-14 04:40:12,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:40:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:40:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:40:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:40:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:40:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:40:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:40:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:40:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:40:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:40:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:40:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:40:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:40:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:40:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:40:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:40:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:40:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:40:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 04:40:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-14 04:40:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-14 04:40:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-14 04:40:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-14 04:40:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-14 04:40:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-14 04:40:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-14 04:40:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-14 04:40:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:40:12,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:12,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550489188] [2022-07-14 04:40:12,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550489188] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:12,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:12,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:40:12,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529440085] [2022-07-14 04:40:12,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:12,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:40:12,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:12,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:40:12,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:40:12,487 INFO L87 Difference]: Start difference. First operand 420 states and 455 transitions. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (45), 6 states have call predecessors, (45), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2022-07-14 04:40:13,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:13,070 INFO L93 Difference]: Finished difference Result 420 states and 455 transitions. [2022-07-14 04:40:13,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:40:13,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (45), 6 states have call predecessors, (45), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 291 [2022-07-14 04:40:13,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:13,098 INFO L225 Difference]: With dead ends: 420 [2022-07-14 04:40:13,098 INFO L226 Difference]: Without dead ends: 418 [2022-07-14 04:40:13,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 04:40:13,099 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 804 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:13,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 688 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 04:40:13,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-07-14 04:40:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2022-07-14 04:40:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 272 states have (on average 1.0330882352941178) internal successors, (281), 279 states have internal predecessors, (281), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-14 04:40:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 453 transitions. [2022-07-14 04:40:13,210 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 453 transitions. Word has length 291 [2022-07-14 04:40:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:13,211 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 453 transitions. [2022-07-14 04:40:13,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (45), 6 states have call predecessors, (45), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2022-07-14 04:40:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 453 transitions. [2022-07-14 04:40:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-07-14 04:40:13,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:13,213 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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, 1, 1, 1] [2022-07-14 04:40:13,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-14 04:40:13,213 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:40:13,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:13,213 INFO L85 PathProgramCache]: Analyzing trace with hash -2019577928, now seen corresponding path program 1 times [2022-07-14 04:40:13,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:13,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803740189] [2022-07-14 04:40:13,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:13,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:40:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:40:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:40:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:40:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:40:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:40:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:40:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:40:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:40:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:40:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:40:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:40:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:40:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:40:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:40:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:40:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:40:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:40:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 04:40:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-14 04:40:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-14 04:40:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-14 04:40:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-14 04:40:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-14 04:40:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-14 04:40:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-14 04:40:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-14 04:40:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-14 04:40:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:13,408 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:40:13,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:13,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803740189] [2022-07-14 04:40:13,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803740189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:13,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:13,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:40:13,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936092497] [2022-07-14 04:40:13,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:13,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:40:13,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:13,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:40:13,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:40:13,410 INFO L87 Difference]: Start difference. First operand 418 states and 453 transitions. Second operand has 8 states, 8 states have (on average 19.25) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (46), 6 states have call predecessors, (46), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2022-07-14 04:40:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:13,960 INFO L93 Difference]: Finished difference Result 418 states and 453 transitions. [2022-07-14 04:40:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:40:13,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (46), 6 states have call predecessors, (46), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 297 [2022-07-14 04:40:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:13,962 INFO L225 Difference]: With dead ends: 418 [2022-07-14 04:40:13,962 INFO L226 Difference]: Without dead ends: 416 [2022-07-14 04:40:13,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 04:40:13,963 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 794 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:13,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 686 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 04:40:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-07-14 04:40:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2022-07-14 04:40:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 271 states have (on average 1.029520295202952) internal successors, (279), 277 states have internal predecessors, (279), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-14 04:40:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 451 transitions. [2022-07-14 04:40:14,072 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 451 transitions. Word has length 297 [2022-07-14 04:40:14,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:14,073 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 451 transitions. [2022-07-14 04:40:14,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (46), 6 states have call predecessors, (46), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2022-07-14 04:40:14,073 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 451 transitions. [2022-07-14 04:40:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2022-07-14 04:40:14,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:14,075 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:40:14,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-14 04:40:14,075 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:40:14,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:14,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1543049479, now seen corresponding path program 1 times [2022-07-14 04:40:14,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:14,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453263001] [2022-07-14 04:40:14,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:14,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:40:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:40:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:40:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:40:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:40:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:40:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:40:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:40:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:40:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:40:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:40:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:40:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:40:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:40:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:40:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:40:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:40:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:40:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 04:40:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-14 04:40:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-14 04:40:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-14 04:40:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-14 04:40:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-14 04:40:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-14 04:40:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-14 04:40:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-14 04:40:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-14 04:40:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-14 04:40:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:40:14,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:14,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453263001] [2022-07-14 04:40:14,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453263001] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:14,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:14,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:40:14,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148596892] [2022-07-14 04:40:14,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:14,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:40:14,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:14,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:40:14,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:40:14,281 INFO L87 Difference]: Start difference. First operand 416 states and 451 transitions. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (47), 6 states have call predecessors, (47), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2022-07-14 04:40:14,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:14,775 INFO L93 Difference]: Finished difference Result 416 states and 451 transitions. [2022-07-14 04:40:14,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:40:14,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (47), 6 states have call predecessors, (47), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 303 [2022-07-14 04:40:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:14,777 INFO L225 Difference]: With dead ends: 416 [2022-07-14 04:40:14,777 INFO L226 Difference]: Without dead ends: 414 [2022-07-14 04:40:14,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 04:40:14,778 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 784 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:14,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 684 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 04:40:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-07-14 04:40:14,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2022-07-14 04:40:14,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 270 states have (on average 1.025925925925926) internal successors, (277), 275 states have internal predecessors, (277), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-14 04:40:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 449 transitions. [2022-07-14 04:40:14,889 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 449 transitions. Word has length 303 [2022-07-14 04:40:14,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:14,889 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 449 transitions. [2022-07-14 04:40:14,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (47), 6 states have call predecessors, (47), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2022-07-14 04:40:14,889 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 449 transitions. [2022-07-14 04:40:14,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-07-14 04:40:14,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:14,891 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:40:14,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-14 04:40:14,891 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:40:14,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:14,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1319340359, now seen corresponding path program 1 times [2022-07-14 04:40:14,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:14,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848411671] [2022-07-14 04:40:14,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:14,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:40:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:40:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:40:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:40:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:40:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:40:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:40:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:40:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:40:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:40:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:40:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:40:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:40:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:40:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:40:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:40:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:40:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:40:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 04:40:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-14 04:40:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-14 04:40:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-14 04:40:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-14 04:40:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-14 04:40:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-14 04:40:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-14 04:40:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-14 04:40:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-14 04:40:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-14 04:40:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-07-14 04:40:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:40:15,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:15,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848411671] [2022-07-14 04:40:15,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848411671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:15,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:15,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:40:15,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845323282] [2022-07-14 04:40:15,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:15,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:40:15,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:15,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:40:15,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:40:15,087 INFO L87 Difference]: Start difference. First operand 414 states and 449 transitions. Second operand has 8 states, 8 states have (on average 20.25) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (48), 6 states have call predecessors, (48), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-07-14 04:40:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:15,511 INFO L93 Difference]: Finished difference Result 414 states and 449 transitions. [2022-07-14 04:40:15,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:40:15,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.25) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (48), 6 states have call predecessors, (48), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 309 [2022-07-14 04:40:15,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:15,515 INFO L225 Difference]: With dead ends: 414 [2022-07-14 04:40:15,515 INFO L226 Difference]: Without dead ends: 412 [2022-07-14 04:40:15,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 04:40:15,519 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 774 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:15,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 682 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 04:40:15,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2022-07-14 04:40:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2022-07-14 04:40:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 269 states have (on average 1.0223048327137547) internal successors, (275), 273 states have internal predecessors, (275), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-14 04:40:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 447 transitions. [2022-07-14 04:40:15,629 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 447 transitions. Word has length 309 [2022-07-14 04:40:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:15,630 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 447 transitions. [2022-07-14 04:40:15,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.25) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (48), 6 states have call predecessors, (48), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-07-14 04:40:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 447 transitions. [2022-07-14 04:40:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2022-07-14 04:40:15,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:15,632 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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, 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:40:15,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-14 04:40:15,632 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:40:15,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:15,632 INFO L85 PathProgramCache]: Analyzing trace with hash 642791397, now seen corresponding path program 1 times [2022-07-14 04:40:15,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:15,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600204988] [2022-07-14 04:40:15,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:15,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:40:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:40:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:40:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:40:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:40:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:40:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:40:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:40:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:40:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:40:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:40:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:40:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:40:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:40:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:40:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:40:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:40:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:40:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 04:40:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-14 04:40:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-14 04:40:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-14 04:40:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-14 04:40:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-14 04:40:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-14 04:40:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-14 04:40:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-14 04:40:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-14 04:40:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-14 04:40:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-07-14 04:40:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-07-14 04:40:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:40:15,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:15,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600204988] [2022-07-14 04:40:15,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600204988] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:15,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:15,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 04:40:15,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950156332] [2022-07-14 04:40:15,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:15,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 04:40:15,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:15,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 04:40:15,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:40:15,839 INFO L87 Difference]: Start difference. First operand 412 states and 447 transitions. Second operand has 10 states, 10 states have (on average 16.6) internal successors, (166), 6 states have internal predecessors, (166), 2 states have call successors, (49), 6 states have call predecessors, (49), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2022-07-14 04:40:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:16,555 INFO L93 Difference]: Finished difference Result 412 states and 447 transitions. [2022-07-14 04:40:16,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 04:40:16,556 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 6 states have internal predecessors, (166), 2 states have call successors, (49), 6 states have call predecessors, (49), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 315 [2022-07-14 04:40:16,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:16,557 INFO L225 Difference]: With dead ends: 412 [2022-07-14 04:40:16,557 INFO L226 Difference]: Without dead ends: 410 [2022-07-14 04:40:16,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2022-07-14 04:40:16,559 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 778 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:16,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 912 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 04:40:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-14 04:40:16,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2022-07-14 04:40:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 268 states have (on average 1.0186567164179106) internal successors, (273), 271 states have internal predecessors, (273), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-14 04:40:16,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 445 transitions. [2022-07-14 04:40:16,670 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 445 transitions. Word has length 315 [2022-07-14 04:40:16,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:16,670 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 445 transitions. [2022-07-14 04:40:16,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 6 states have internal predecessors, (166), 2 states have call successors, (49), 6 states have call predecessors, (49), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2022-07-14 04:40:16,671 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 445 transitions. [2022-07-14 04:40:16,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-07-14 04:40:16,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:16,673 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 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, 1, 1, 1, 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:40:16,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-14 04:40:16,674 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:40:16,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:16,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1312174456, now seen corresponding path program 1 times [2022-07-14 04:40:16,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:16,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743834666] [2022-07-14 04:40:16,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:16,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 04:40:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:40:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:40:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 04:40:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 04:40:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:40:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:40:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:40:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:40:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:40:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:40:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:40:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 04:40:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:40:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 04:40:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:40:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:40:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 04:40:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 04:40:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-14 04:40:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-14 04:40:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-14 04:40:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-14 04:40:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-14 04:40:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-14 04:40:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-14 04:40:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-14 04:40:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-14 04:40:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-14 04:40:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-07-14 04:40:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-07-14 04:40:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-07-14 04:40:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,919 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-14 04:40:16,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:16,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743834666] [2022-07-14 04:40:16,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743834666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:16,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:16,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:40:16,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303486724] [2022-07-14 04:40:16,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:16,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:40:16,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:16,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:40:16,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:40:16,921 INFO L87 Difference]: Start difference. First operand 410 states and 445 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 4 states have internal predecessors, (170), 2 states have call successors, (50), 6 states have call predecessors, (50), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2022-07-14 04:40:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:17,421 INFO L93 Difference]: Finished difference Result 410 states and 445 transitions. [2022-07-14 04:40:17,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:40:17,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 4 states have internal predecessors, (170), 2 states have call successors, (50), 6 states have call predecessors, (50), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 321 [2022-07-14 04:40:17,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:17,422 INFO L225 Difference]: With dead ends: 410 [2022-07-14 04:40:17,422 INFO L226 Difference]: Without dead ends: 0 [2022-07-14 04:40:17,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 04:40:17,423 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 751 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:17,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 679 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 04:40:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-14 04:40:17,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-14 04:40:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 04:40:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-14 04:40:17,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 321 [2022-07-14 04:40:17,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:17,425 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 04:40:17,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 4 states have internal predecessors, (170), 2 states have call successors, (50), 6 states have call predecessors, (50), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2022-07-14 04:40:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-14 04:40:17,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-14 04:40:17,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (28 of 29 remaining) [2022-07-14 04:40:17,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (27 of 29 remaining) [2022-07-14 04:40:17,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (26 of 29 remaining) [2022-07-14 04:40:17,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (25 of 29 remaining) [2022-07-14 04:40:17,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_fs_char_dev__double_registrationErr0ASSERT_VIOLATIONERROR_FUNCTION (24 of 29 remaining) [2022-07-14 04:40:17,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (23 of 29 remaining) [2022-07-14 04:40:17,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (22 of 29 remaining) [2022-07-14 04:40:17,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (21 of 29 remaining) [2022-07-14 04:40:17,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (20 of 29 remaining) [2022-07-14 04:40:17,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_drivers_base_class__double_registrationErr0ASSERT_VIOLATIONERROR_FUNCTION (19 of 29 remaining) [2022-07-14 04:40:17,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (18 of 29 remaining) [2022-07-14 04:40:17,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 29 remaining) [2022-07-14 04:40:17,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 29 remaining) [2022-07-14 04:40:17,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 29 remaining) [2022-07-14 04:40:17,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (14 of 29 remaining) [2022-07-14 04:40:17,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (13 of 29 remaining) [2022-07-14 04:40:17,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_gadget_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION (12 of 29 remaining) [2022-07-14 04:40:17,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2022-07-14 04:40:17,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 29 remaining) [2022-07-14 04:40:17,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 29 remaining) [2022-07-14 04:40:17,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 29 remaining) [2022-07-14 04:40:17,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 29 remaining) [2022-07-14 04:40:17,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 29 remaining) [2022-07-14 04:40:17,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 29 remaining) [2022-07-14 04:40:17,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 29 remaining) [2022-07-14 04:40:17,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 29 remaining) [2022-07-14 04:40:17,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 29 remaining) [2022-07-14 04:40:17,447 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 29 remaining) [2022-07-14 04:40:17,447 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 29 remaining) [2022-07-14 04:40:17,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-14 04:40:17,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-14 04:41:45,834 WARN L233 SmtUtils]: Spent 1.35m on a formula simplification. DAG size of input: 281 DAG size of output: 279 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)