./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.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 f0d35ad3183ac446cae7457c51fa9452f8942f4b349e6e40633392db1dd8aa97 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 04:07:08,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 04:07:08,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 04:07:08,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 04:07:08,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 04:07:08,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 04:07:08,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 04:07:08,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 04:07:08,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 04:07:08,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 04:07:08,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 04:07:08,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 04:07:08,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 04:07:08,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 04:07:08,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 04:07:08,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 04:07:08,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 04:07:08,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 04:07:08,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 04:07:08,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 04:07:08,704 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 04:07:08,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 04:07:08,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 04:07:08,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 04:07:08,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 04:07:08,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 04:07:08,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 04:07:08,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 04:07:08,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 04:07:08,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 04:07:08,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 04:07:08,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 04:07:08,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 04:07:08,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 04:07:08,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 04:07:08,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 04:07:08,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 04:07:08,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 04:07:08,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 04:07:08,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 04:07:08,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 04:07:08,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 04:07:08,726 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 04:07:08,760 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 04:07:08,760 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 04:07:08,761 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 04:07:08,761 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 04:07:08,762 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 04:07:08,762 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 04:07:08,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 04:07:08,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 04:07:08,763 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 04:07:08,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 04:07:08,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 04:07:08,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 04:07:08,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 04:07:08,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 04:07:08,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 04:07:08,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 04:07:08,765 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 04:07:08,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 04:07:08,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 04:07:08,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 04:07:08,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 04:07:08,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:07:08,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 04:07:08,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 04:07:08,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 04:07:08,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 04:07:08,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 04:07:08,767 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 04:07:08,767 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 04:07:08,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 04:07:08,768 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 -> f0d35ad3183ac446cae7457c51fa9452f8942f4b349e6e40633392db1dd8aa97 [2022-07-20 04:07:08,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 04:07:09,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 04:07:09,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 04:07:09,022 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 04:07:09,023 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 04:07:09,024 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i [2022-07-20 04:07:09,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5599c0099/9849d5ab5a8b4567b51608aad3b2e302/FLAG26e888f3d [2022-07-20 04:07:09,829 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 04:07:09,830 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i [2022-07-20 04:07:09,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5599c0099/9849d5ab5a8b4567b51608aad3b2e302/FLAG26e888f3d [2022-07-20 04:07:10,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5599c0099/9849d5ab5a8b4567b51608aad3b2e302 [2022-07-20 04:07:10,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 04:07:10,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 04:07:10,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 04:07:10,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 04:07:10,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 04:07:10,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:07:10" (1/1) ... [2022-07-20 04:07:10,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53751e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:07:10, skipping insertion in model container [2022-07-20 04:07:10,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:07:10" (1/1) ... [2022-07-20 04:07:10,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 04:07:10,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 04:07:13,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385539,385552] [2022-07-20 04:07:13,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385684,385697] [2022-07-20 04:07:13,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385830,385843] [2022-07-20 04:07:13,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385995,386008] [2022-07-20 04:07:13,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386153,386166] [2022-07-20 04:07:13,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386311,386324] [2022-07-20 04:07:13,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386469,386482] [2022-07-20 04:07:13,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386629,386642] [2022-07-20 04:07:13,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386788,386801] [2022-07-20 04:07:13,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386927,386940] [2022-07-20 04:07:13,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387069,387082] [2022-07-20 04:07:13,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387218,387231] [2022-07-20 04:07:13,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387357,387370] [2022-07-20 04:07:13,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387512,387525] [2022-07-20 04:07:13,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387672,387685] [2022-07-20 04:07:13,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387823,387836] [2022-07-20 04:07:13,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387974,387987] [2022-07-20 04:07:13,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388126,388139] [2022-07-20 04:07:13,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388275,388288] [2022-07-20 04:07:13,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388423,388436] [2022-07-20 04:07:13,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388580,388593] [2022-07-20 04:07:13,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388729,388742] [2022-07-20 04:07:13,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388885,388898] [2022-07-20 04:07:13,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389038,389051] [2022-07-20 04:07:13,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389184,389197] [2022-07-20 04:07:13,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389327,389340] [2022-07-20 04:07:13,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389479,389492] [2022-07-20 04:07:13,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389625,389638] [2022-07-20 04:07:13,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389770,389783] [2022-07-20 04:07:13,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389924,389937] [2022-07-20 04:07:13,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390075,390088] [2022-07-20 04:07:13,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390230,390243] [2022-07-20 04:07:13,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390382,390395] [2022-07-20 04:07:13,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390537,390550] [2022-07-20 04:07:13,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390701,390714] [2022-07-20 04:07:13,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390857,390870] [2022-07-20 04:07:13,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391021,391034] [2022-07-20 04:07:13,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391163,391176] [2022-07-20 04:07:13,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391321,391334] [2022-07-20 04:07:13,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391488,391501] [2022-07-20 04:07:13,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391647,391660] [2022-07-20 04:07:13,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391806,391819] [2022-07-20 04:07:13,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391955,391968] [2022-07-20 04:07:13,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392102,392115] [2022-07-20 04:07:13,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392241,392254] [2022-07-20 04:07:13,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392404,392417] [2022-07-20 04:07:13,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392570,392583] [2022-07-20 04:07:13,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392734,392747] [2022-07-20 04:07:13,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392899,392912] [2022-07-20 04:07:13,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393064,393077] [2022-07-20 04:07:13,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393230,393243] [2022-07-20 04:07:13,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393395,393408] [2022-07-20 04:07:13,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393562,393575] [2022-07-20 04:07:13,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393722,393735] [2022-07-20 04:07:13,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393884,393897] [2022-07-20 04:07:13,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394043,394056] [2022-07-20 04:07:13,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394189,394202] [2022-07-20 04:07:13,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394332,394345] [2022-07-20 04:07:13,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394476,394489] [2022-07-20 04:07:13,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394619,394632] [2022-07-20 04:07:13,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394763,394776] [2022-07-20 04:07:13,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394904,394917] [2022-07-20 04:07:13,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395042,395055] [2022-07-20 04:07:13,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395200,395213] [2022-07-20 04:07:13,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395359,395372] [2022-07-20 04:07:13,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395515,395528] [2022-07-20 04:07:13,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395664,395677] [2022-07-20 04:07:13,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395816,395829] [2022-07-20 04:07:13,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395967,395980] [2022-07-20 04:07:13,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396116,396129] [2022-07-20 04:07:13,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396268,396281] [2022-07-20 04:07:13,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396416,396429] [2022-07-20 04:07:13,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396569,396582] [2022-07-20 04:07:13,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396720,396733] [2022-07-20 04:07:13,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396870,396883] [2022-07-20 04:07:13,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397017,397030] [2022-07-20 04:07:13,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397168,397181] [2022-07-20 04:07:13,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397319,397332] [2022-07-20 04:07:13,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397467,397480] [2022-07-20 04:07:13,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397633,397646] [2022-07-20 04:07:13,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397802,397815] [2022-07-20 04:07:13,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397969,397982] [2022-07-20 04:07:13,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398137,398150] [2022-07-20 04:07:13,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398287,398300] [2022-07-20 04:07:13,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398434,398447] [2022-07-20 04:07:13,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398595,398608] [2022-07-20 04:07:13,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398765,398778] [2022-07-20 04:07:13,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398927,398940] [2022-07-20 04:07:13,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:07:13,471 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 04:07:13,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385539,385552] [2022-07-20 04:07:13,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385684,385697] [2022-07-20 04:07:13,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385830,385843] [2022-07-20 04:07:13,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385995,386008] [2022-07-20 04:07:13,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386153,386166] [2022-07-20 04:07:13,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386311,386324] [2022-07-20 04:07:13,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386469,386482] [2022-07-20 04:07:13,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386629,386642] [2022-07-20 04:07:13,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386788,386801] [2022-07-20 04:07:13,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386927,386940] [2022-07-20 04:07:13,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387069,387082] [2022-07-20 04:07:13,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387218,387231] [2022-07-20 04:07:13,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387357,387370] [2022-07-20 04:07:13,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387512,387525] [2022-07-20 04:07:13,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387672,387685] [2022-07-20 04:07:13,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387823,387836] [2022-07-20 04:07:13,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387974,387987] [2022-07-20 04:07:13,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388126,388139] [2022-07-20 04:07:13,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388275,388288] [2022-07-20 04:07:13,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388423,388436] [2022-07-20 04:07:13,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388580,388593] [2022-07-20 04:07:13,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388729,388742] [2022-07-20 04:07:13,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388885,388898] [2022-07-20 04:07:13,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389038,389051] [2022-07-20 04:07:13,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389184,389197] [2022-07-20 04:07:13,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389327,389340] [2022-07-20 04:07:13,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389479,389492] [2022-07-20 04:07:13,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389625,389638] [2022-07-20 04:07:13,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389770,389783] [2022-07-20 04:07:13,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389924,389937] [2022-07-20 04:07:13,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390075,390088] [2022-07-20 04:07:13,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390230,390243] [2022-07-20 04:07:13,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390382,390395] [2022-07-20 04:07:13,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390537,390550] [2022-07-20 04:07:13,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390701,390714] [2022-07-20 04:07:13,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390857,390870] [2022-07-20 04:07:13,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391021,391034] [2022-07-20 04:07:13,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391163,391176] [2022-07-20 04:07:13,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391321,391334] [2022-07-20 04:07:13,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391488,391501] [2022-07-20 04:07:13,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391647,391660] [2022-07-20 04:07:13,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391806,391819] [2022-07-20 04:07:13,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391955,391968] [2022-07-20 04:07:13,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392102,392115] [2022-07-20 04:07:13,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392241,392254] [2022-07-20 04:07:13,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392404,392417] [2022-07-20 04:07:13,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392570,392583] [2022-07-20 04:07:13,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392734,392747] [2022-07-20 04:07:13,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392899,392912] [2022-07-20 04:07:13,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393064,393077] [2022-07-20 04:07:13,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393230,393243] [2022-07-20 04:07:13,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393395,393408] [2022-07-20 04:07:13,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393562,393575] [2022-07-20 04:07:13,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393722,393735] [2022-07-20 04:07:13,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393884,393897] [2022-07-20 04:07:13,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394043,394056] [2022-07-20 04:07:13,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394189,394202] [2022-07-20 04:07:13,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394332,394345] [2022-07-20 04:07:13,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394476,394489] [2022-07-20 04:07:13,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394619,394632] [2022-07-20 04:07:13,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394763,394776] [2022-07-20 04:07:13,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394904,394917] [2022-07-20 04:07:13,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395042,395055] [2022-07-20 04:07:13,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395200,395213] [2022-07-20 04:07:13,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395359,395372] [2022-07-20 04:07:13,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395515,395528] [2022-07-20 04:07:13,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395664,395677] [2022-07-20 04:07:13,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395816,395829] [2022-07-20 04:07:13,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395967,395980] [2022-07-20 04:07:13,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396116,396129] [2022-07-20 04:07:13,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396268,396281] [2022-07-20 04:07:13,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396416,396429] [2022-07-20 04:07:13,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396569,396582] [2022-07-20 04:07:13,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396720,396733] [2022-07-20 04:07:13,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396870,396883] [2022-07-20 04:07:13,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397017,397030] [2022-07-20 04:07:13,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397168,397181] [2022-07-20 04:07:13,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397319,397332] [2022-07-20 04:07:13,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397467,397480] [2022-07-20 04:07:13,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397633,397646] [2022-07-20 04:07:13,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397802,397815] [2022-07-20 04:07:13,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397969,397982] [2022-07-20 04:07:13,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398137,398150] [2022-07-20 04:07:13,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398287,398300] [2022-07-20 04:07:13,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398434,398447] [2022-07-20 04:07:13,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398595,398608] [2022-07-20 04:07:13,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398765,398778] [2022-07-20 04:07:13,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398927,398940] [2022-07-20 04:07:13,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:07:14,097 INFO L208 MainTranslator]: Completed translation [2022-07-20 04:07:14,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:07:14 WrapperNode [2022-07-20 04:07:14,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 04:07:14,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 04:07:14,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 04:07:14,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 04:07:14,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:07:14" (1/1) ... [2022-07-20 04:07:14,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:07:14" (1/1) ... [2022-07-20 04:07:14,386 INFO L137 Inliner]: procedures = 616, calls = 2803, calls flagged for inlining = 287, calls inlined = 187, statements flattened = 4770 [2022-07-20 04:07:14,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 04:07:14,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 04:07:14,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 04:07:14,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 04:07:14,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:07:14" (1/1) ... [2022-07-20 04:07:14,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:07:14" (1/1) ... [2022-07-20 04:07:14,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:07:14" (1/1) ... [2022-07-20 04:07:14,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:07:14" (1/1) ... [2022-07-20 04:07:14,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:07:14" (1/1) ... [2022-07-20 04:07:14,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:07:14" (1/1) ... [2022-07-20 04:07:14,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:07:14" (1/1) ... [2022-07-20 04:07:14,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 04:07:14,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 04:07:14,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 04:07:14,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 04:07:14,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:07:14" (1/1) ... [2022-07-20 04:07:14,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:07:14,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:07:14,668 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-20 04:07:14,693 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-20 04:07:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:07:14,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:07:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-20 04:07:14,715 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-20 04:07:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 04:07:14,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 04:07:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_device_lock_of_kaweth_device [2022-07-20 04:07:14,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_device_lock_of_kaweth_device [2022-07-20 04:07:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:07:14,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:07:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-20 04:07:14,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-20 04:07:14,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 04:07:14,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 04:07:14,717 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_open [2022-07-20 04:07:14,718 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_open [2022-07-20 04:07:14,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:07:14,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:07:14,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:07:14,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:07:14,719 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-20 04:07:14,719 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_resume [2022-07-20 04:07:14,720 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_resume [2022-07-20 04:07:14,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-20 04:07:14,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-20 04:07:14,720 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-07-20 04:07:14,720 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-07-20 04:07:14,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 04:07:14,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 04:07:14,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:07:14,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:07:14,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 04:07:14,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:07:14,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:07:14,721 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-20 04:07:14,721 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-20 04:07:14,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-20 04:07:14,722 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_resubmit_rx_urb [2022-07-20 04:07:14,722 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_resubmit_rx_urb [2022-07-20 04:07:14,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 04:07:14,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-20 04:07:14,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-20 04:07:14,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-20 04:07:14,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-20 04:07:14,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:07:14,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:07:14,723 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2022-07-20 04:07:14,723 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2022-07-20 04:07:14,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 04:07:14,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:07:14,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:07:14,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-20 04:07:14,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-20 04:07:14,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-20 04:07:14,724 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-20 04:07:14,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:07:14,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:07:14,725 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-20 04:07:14,725 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-20 04:07:14,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-20 04:07:14,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-20 04:07:14,725 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_close [2022-07-20 04:07:14,726 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_close [2022-07-20 04:07:14,726 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:07:14,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:07:14,726 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_129 [2022-07-20 04:07:14,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_129 [2022-07-20 04:07:14,726 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_download_firmware [2022-07-20 04:07:14,726 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_download_firmware [2022-07-20 04:07:14,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:07:14,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:07:14,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 04:07:14,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 04:07:14,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-20 04:07:14,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-20 04:07:14,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 04:07:14,731 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-20 04:07:14,731 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-20 04:07:14,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-20 04:07:14,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-20 04:07:14,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-20 04:07:14,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:07:14,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:07:14,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-20 04:07:14,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-20 04:07:14,733 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2022-07-20 04:07:14,733 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2022-07-20 04:07:14,733 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-20 04:07:14,733 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-20 04:07:14,734 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_tx_timeout [2022-07-20 04:07:14,734 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_tx_timeout [2022-07-20 04:07:14,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 04:07:14,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 04:07:14,734 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-20 04:07:14,734 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-20 04:07:14,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-20 04:07:14,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-20 04:07:14,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 04:07:14,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 04:07:14,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 04:07:14,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 04:07:14,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_133 [2022-07-20 04:07:14,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_133 [2022-07-20 04:07:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-20 04:07:14,736 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-20 04:07:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_async_set_rx_mode [2022-07-20 04:07:14,736 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_async_set_rx_mode [2022-07-20 04:07:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_device_lock_of_kaweth_device [2022-07-20 04:07:14,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_device_lock_of_kaweth_device [2022-07-20 04:07:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-20 04:07:14,737 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-20 04:07:14,737 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:07:14,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:07:14,737 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-20 04:07:14,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-20 04:07:14,737 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:07:14,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:07:14,738 INFO L130 BoogieDeclarations]: Found specification of procedure netif_start_queue [2022-07-20 04:07:14,738 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_start_queue [2022-07-20 04:07:14,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 04:07:14,738 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-20 04:07:14,738 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-20 04:07:14,739 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:07:14,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:07:14,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 04:07:14,739 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-20 04:07:14,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-20 04:07:14,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 04:07:14,740 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:07:14,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:07:14,740 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-20 04:07:14,740 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-20 04:07:14,740 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-20 04:07:14,740 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-20 04:07:14,740 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-20 04:07:14,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-20 04:07:14,741 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2022-07-20 04:07:14,741 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2022-07-20 04:07:14,741 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-07-20 04:07:14,741 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-07-20 04:07:14,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-20 04:07:14,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-20 04:07:14,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-20 04:07:14,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-20 04:07:14,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:07:14,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:07:14,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:07:14,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:07:14,742 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-20 04:07:14,742 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-20 04:07:14,743 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_set_rx_mode [2022-07-20 04:07:14,743 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_set_rx_mode [2022-07-20 04:07:14,743 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-20 04:07:14,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-20 04:07:14,743 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-20 04:07:14,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-20 04:07:14,743 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:07:14,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:07:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 04:07:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:07:14,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:07:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 04:07:14,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 04:07:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:07:14,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:07:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_resubmit_int_urb [2022-07-20 04:07:14,745 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_resubmit_int_urb [2022-07-20 04:07:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_control [2022-07-20 04:07:14,745 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_control [2022-07-20 04:07:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-20 04:07:14,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-20 04:07:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:07:14,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:07:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2022-07-20 04:07:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_kill_urbs [2022-07-20 04:07:14,746 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_kill_urbs [2022-07-20 04:07:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_disconnect [2022-07-20 04:07:14,747 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_disconnect [2022-07-20 04:07:14,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 04:07:14,747 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2022-07-20 04:07:14,747 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2022-07-20 04:07:15,510 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 04:07:15,514 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 04:07:15,659 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 04:07:21,105 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 04:07:21,128 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 04:07:21,128 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 04:07:21,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:07:21 BoogieIcfgContainer [2022-07-20 04:07:21,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 04:07:21,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 04:07:21,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 04:07:21,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 04:07:21,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 04:07:10" (1/3) ... [2022-07-20 04:07:21,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a66b075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:07:21, skipping insertion in model container [2022-07-20 04:07:21,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:07:14" (2/3) ... [2022-07-20 04:07:21,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a66b075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:07:21, skipping insertion in model container [2022-07-20 04:07:21,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:07:21" (3/3) ... [2022-07-20 04:07:21,142 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i [2022-07-20 04:07:21,156 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 04:07:21,157 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-07-20 04:07:21,246 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 04:07:21,255 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@4f65f977, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@16f65254 [2022-07-20 04:07:21,255 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-07-20 04:07:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 1202 states, 791 states have (on average 1.2414664981036663) internal successors, (982), 831 states have internal predecessors, (982), 301 states have call successors, (301), 81 states have call predecessors, (301), 80 states have return successors, (297), 296 states have call predecessors, (297), 297 states have call successors, (297) [2022-07-20 04:07:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-20 04:07:21,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:21,283 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:07:21,283 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:07:21,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:21,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1445783568, now seen corresponding path program 1 times [2022-07-20 04:07:21,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:21,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105491033] [2022-07-20 04:07:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:21,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:22,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:22,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:22,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:07:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:22,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:07:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:22,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:07:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:22,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:07:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:22,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:22,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:22,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:07:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:22,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:07:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:07:22,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:22,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105491033] [2022-07-20 04:07:22,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105491033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:22,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:07:22,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:07:22,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48027775] [2022-07-20 04:07:22,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:22,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:07:22,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:07:22,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:07:22,375 INFO L87 Difference]: Start difference. First operand has 1202 states, 791 states have (on average 1.2414664981036663) internal successors, (982), 831 states have internal predecessors, (982), 301 states have call successors, (301), 81 states have call predecessors, (301), 80 states have return successors, (297), 296 states have call predecessors, (297), 297 states have call successors, (297) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-20 04:07:25,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:25,883 INFO L93 Difference]: Finished difference Result 2297 states and 3120 transitions. [2022-07-20 04:07:25,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:07:25,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2022-07-20 04:07:25,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:25,906 INFO L225 Difference]: With dead ends: 2297 [2022-07-20 04:07:25,906 INFO L226 Difference]: Without dead ends: 1183 [2022-07-20 04:07:25,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:07:25,924 INFO L413 NwaCegarLoop]: 1432 mSDtfsCounter, 2179 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 1024 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2361 SdHoareTripleChecker+Valid, 2846 SdHoareTripleChecker+Invalid, 2458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1024 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:07:25,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2361 Valid, 2846 Invalid, 2458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1024 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-20 04:07:25,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2022-07-20 04:07:26,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2022-07-20 04:07:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 779 states have (on average 1.196405648267009) internal successors, (932), 815 states have internal predecessors, (932), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-20 04:07:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1524 transitions. [2022-07-20 04:07:26,049 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1524 transitions. Word has length 71 [2022-07-20 04:07:26,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:26,050 INFO L495 AbstractCegarLoop]: Abstraction has 1183 states and 1524 transitions. [2022-07-20 04:07:26,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-20 04:07:26,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1524 transitions. [2022-07-20 04:07:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-20 04:07:26,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:26,059 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:07:26,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 04:07:26,059 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:07:26,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:26,060 INFO L85 PathProgramCache]: Analyzing trace with hash -559581025, now seen corresponding path program 1 times [2022-07-20 04:07:26,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:26,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169555787] [2022-07-20 04:07:26,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:26,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:07:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:07:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:07:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:07:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:07:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:07:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:07:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:07:26,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:26,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169555787] [2022-07-20 04:07:26,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169555787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:26,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:07:26,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:07:26,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654229595] [2022-07-20 04:07:26,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:26,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:07:26,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:26,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:07:26,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:07:26,602 INFO L87 Difference]: Start difference. First operand 1183 states and 1524 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-20 04:07:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:29,093 INFO L93 Difference]: Finished difference Result 1183 states and 1524 transitions. [2022-07-20 04:07:29,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:07:29,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2022-07-20 04:07:29,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:29,102 INFO L225 Difference]: With dead ends: 1183 [2022-07-20 04:07:29,102 INFO L226 Difference]: Without dead ends: 1181 [2022-07-20 04:07:29,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:07:29,104 INFO L413 NwaCegarLoop]: 1414 mSDtfsCounter, 2147 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 2812 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:07:29,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2326 Valid, 2812 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-20 04:07:29,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2022-07-20 04:07:29,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1181. [2022-07-20 04:07:29,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 778 states have (on average 1.1953727506426735) internal successors, (930), 813 states have internal predecessors, (930), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-20 04:07:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1522 transitions. [2022-07-20 04:07:29,153 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1522 transitions. Word has length 77 [2022-07-20 04:07:29,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:29,154 INFO L495 AbstractCegarLoop]: Abstraction has 1181 states and 1522 transitions. [2022-07-20 04:07:29,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-20 04:07:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1522 transitions. [2022-07-20 04:07:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-20 04:07:29,155 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:29,156 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:07:29,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 04:07:29,156 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:07:29,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:29,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1865614216, now seen corresponding path program 1 times [2022-07-20 04:07:29,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:29,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004109439] [2022-07-20 04:07:29,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:29,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:07:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:07:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:07:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:07:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:07:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:07:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:07:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:07:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:07:29,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:29,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004109439] [2022-07-20 04:07:29,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004109439] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:29,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:07:29,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:07:29,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628735732] [2022-07-20 04:07:29,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:29,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:07:29,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:29,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:07:29,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:07:29,650 INFO L87 Difference]: Start difference. First operand 1181 states and 1522 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 04:07:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:32,599 INFO L93 Difference]: Finished difference Result 1181 states and 1522 transitions. [2022-07-20 04:07:32,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:07:32,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2022-07-20 04:07:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:32,606 INFO L225 Difference]: With dead ends: 1181 [2022-07-20 04:07:32,607 INFO L226 Difference]: Without dead ends: 1179 [2022-07-20 04:07:32,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:07:32,608 INFO L413 NwaCegarLoop]: 1412 mSDtfsCounter, 2141 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2319 SdHoareTripleChecker+Valid, 2810 SdHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:07:32,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2319 Valid, 2810 Invalid, 2434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-20 04:07:32,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-07-20 04:07:32,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1179. [2022-07-20 04:07:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 777 states have (on average 1.1943371943371943) internal successors, (928), 811 states have internal predecessors, (928), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-20 04:07:32,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1520 transitions. [2022-07-20 04:07:32,691 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1520 transitions. Word has length 83 [2022-07-20 04:07:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:32,692 INFO L495 AbstractCegarLoop]: Abstraction has 1179 states and 1520 transitions. [2022-07-20 04:07:32,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 04:07:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1520 transitions. [2022-07-20 04:07:32,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-20 04:07:32,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:32,695 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:07:32,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 04:07:32,695 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:07:32,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:32,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2110063066, now seen corresponding path program 1 times [2022-07-20 04:07:32,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:32,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792223091] [2022-07-20 04:07:32,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:32,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:33,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:33,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:33,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:07:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:33,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:07:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:33,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:07:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:33,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:07:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:33,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:07:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:33,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:07:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:33,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:07:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:33,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:07:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:33,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:07:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:07:33,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:33,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792223091] [2022-07-20 04:07:33,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792223091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:33,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:07:33,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:07:33,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471266395] [2022-07-20 04:07:33,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:33,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:07:33,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:33,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:07:33,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:07:33,144 INFO L87 Difference]: Start difference. First operand 1179 states and 1520 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 04:07:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:36,396 INFO L93 Difference]: Finished difference Result 1179 states and 1520 transitions. [2022-07-20 04:07:36,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:07:36,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2022-07-20 04:07:36,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:36,403 INFO L225 Difference]: With dead ends: 1179 [2022-07-20 04:07:36,404 INFO L226 Difference]: Without dead ends: 1177 [2022-07-20 04:07:36,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:07:36,405 INFO L413 NwaCegarLoop]: 1410 mSDtfsCounter, 2135 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2312 SdHoareTripleChecker+Valid, 2808 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:07:36,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2312 Valid, 2808 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-20 04:07:36,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2022-07-20 04:07:36,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1177. [2022-07-20 04:07:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 776 states have (on average 1.193298969072165) internal successors, (926), 809 states have internal predecessors, (926), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-20 04:07:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1518 transitions. [2022-07-20 04:07:36,495 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1518 transitions. Word has length 89 [2022-07-20 04:07:36,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:36,495 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1518 transitions. [2022-07-20 04:07:36,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 04:07:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1518 transitions. [2022-07-20 04:07:36,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-20 04:07:36,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:36,497 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:07:36,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 04:07:36,498 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:07:36,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1926875297, now seen corresponding path program 1 times [2022-07-20 04:07:36,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:36,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464456890] [2022-07-20 04:07:36,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:36,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:36,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:36,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:36,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:07:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:36,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:07:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:36,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:07:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:36,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:07:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:36,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:36,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:36,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:07:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:36,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:07:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:36,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:07:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:36,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:07:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:36,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:07:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:37,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:07:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:07:37,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:37,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464456890] [2022-07-20 04:07:37,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464456890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:37,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:07:37,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:07:37,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710282318] [2022-07-20 04:07:37,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:37,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:07:37,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:37,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:07:37,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:07:37,013 INFO L87 Difference]: Start difference. First operand 1177 states and 1518 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-20 04:07:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:39,590 INFO L93 Difference]: Finished difference Result 1177 states and 1518 transitions. [2022-07-20 04:07:39,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:07:39,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2022-07-20 04:07:39,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:39,600 INFO L225 Difference]: With dead ends: 1177 [2022-07-20 04:07:39,600 INFO L226 Difference]: Without dead ends: 1175 [2022-07-20 04:07:39,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:07:39,601 INFO L413 NwaCegarLoop]: 1408 mSDtfsCounter, 2129 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2305 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 2430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:07:39,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2305 Valid, 2806 Invalid, 2430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-20 04:07:39,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2022-07-20 04:07:39,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1175. [2022-07-20 04:07:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 775 states have (on average 1.192258064516129) internal successors, (924), 807 states have internal predecessors, (924), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-20 04:07:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1516 transitions. [2022-07-20 04:07:39,673 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1516 transitions. Word has length 95 [2022-07-20 04:07:39,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:39,674 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1516 transitions. [2022-07-20 04:07:39,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-20 04:07:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1516 transitions. [2022-07-20 04:07:39,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-20 04:07:39,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:39,676 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:07:39,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 04:07:39,676 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:07:39,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:39,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2113908543, now seen corresponding path program 1 times [2022-07-20 04:07:39,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:39,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075172290] [2022-07-20 04:07:39,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:39,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:39,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:39,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:39,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:07:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:39,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:07:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:39,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:07:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:39,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:07:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:40,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:40,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:40,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:07:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:40,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:07:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:40,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:07:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:40,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:07:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:40,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:07:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:40,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:07:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:40,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:07:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:07:40,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:40,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075172290] [2022-07-20 04:07:40,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075172290] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:40,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:07:40,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:07:40,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001336126] [2022-07-20 04:07:40,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:40,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:07:40,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:40,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:07:40,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:07:40,060 INFO L87 Difference]: Start difference. First operand 1175 states and 1516 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-20 04:07:42,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:42,495 INFO L93 Difference]: Finished difference Result 1175 states and 1516 transitions. [2022-07-20 04:07:42,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:07:42,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2022-07-20 04:07:42,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:42,503 INFO L225 Difference]: With dead ends: 1175 [2022-07-20 04:07:42,504 INFO L226 Difference]: Without dead ends: 1173 [2022-07-20 04:07:42,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:07:42,505 INFO L413 NwaCegarLoop]: 1406 mSDtfsCounter, 2123 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 2804 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:07:42,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 2804 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 04:07:42,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2022-07-20 04:07:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1173. [2022-07-20 04:07:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 774 states have (on average 1.1912144702842378) internal successors, (922), 805 states have internal predecessors, (922), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-20 04:07:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1514 transitions. [2022-07-20 04:07:42,577 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1514 transitions. Word has length 101 [2022-07-20 04:07:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:42,577 INFO L495 AbstractCegarLoop]: Abstraction has 1173 states and 1514 transitions. [2022-07-20 04:07:42,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-20 04:07:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1514 transitions. [2022-07-20 04:07:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-20 04:07:42,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:42,580 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:07:42,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 04:07:42,580 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:07:42,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:42,581 INFO L85 PathProgramCache]: Analyzing trace with hash -792552921, now seen corresponding path program 1 times [2022-07-20 04:07:42,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:42,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227038541] [2022-07-20 04:07:42,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:42,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:42,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:42,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:42,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:07:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:42,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:07:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:42,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:07:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:42,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:07:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:42,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:42,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:07:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:42,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:07:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:42,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:07:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:42,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:07:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:42,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:07:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:42,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:07:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:42,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:07:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:42,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:07:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:07:42,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:42,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227038541] [2022-07-20 04:07:42,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227038541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:42,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:07:42,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:07:42,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021450626] [2022-07-20 04:07:42,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:42,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:07:42,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:42,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:07:42,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:07:42,984 INFO L87 Difference]: Start difference. First operand 1173 states and 1514 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-20 04:07:45,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:45,207 INFO L93 Difference]: Finished difference Result 1173 states and 1514 transitions. [2022-07-20 04:07:45,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:07:45,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2022-07-20 04:07:45,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:45,212 INFO L225 Difference]: With dead ends: 1173 [2022-07-20 04:07:45,212 INFO L226 Difference]: Without dead ends: 1171 [2022-07-20 04:07:45,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:07:45,214 INFO L413 NwaCegarLoop]: 1404 mSDtfsCounter, 2117 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2291 SdHoareTripleChecker+Valid, 2802 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:07:45,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2291 Valid, 2802 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-20 04:07:45,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2022-07-20 04:07:45,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1171. [2022-07-20 04:07:45,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 773 states have (on average 1.1901681759379044) internal successors, (920), 803 states have internal predecessors, (920), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-20 04:07:45,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1512 transitions. [2022-07-20 04:07:45,292 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1512 transitions. Word has length 107 [2022-07-20 04:07:45,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:45,292 INFO L495 AbstractCegarLoop]: Abstraction has 1171 states and 1512 transitions. [2022-07-20 04:07:45,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-20 04:07:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1512 transitions. [2022-07-20 04:07:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-20 04:07:45,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:45,294 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:45,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 04:07:45,294 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:07:45,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:45,295 INFO L85 PathProgramCache]: Analyzing trace with hash 254667010, now seen corresponding path program 1 times [2022-07-20 04:07:45,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:45,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551242677] [2022-07-20 04:07:45,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:45,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:07:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:07:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:07:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:07:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:07:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:07:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:07:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:07:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:07:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:07:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:07:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:07:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:07:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:45,657 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:07:45,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:45,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551242677] [2022-07-20 04:07:45,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551242677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:45,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:07:45,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:07:45,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074955620] [2022-07-20 04:07:45,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:45,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:07:45,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:45,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:07:45,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:07:45,660 INFO L87 Difference]: Start difference. First operand 1171 states and 1512 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (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-20 04:07:48,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:48,021 INFO L93 Difference]: Finished difference Result 1171 states and 1512 transitions. [2022-07-20 04:07:48,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:07:48,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (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 113 [2022-07-20 04:07:48,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:48,027 INFO L225 Difference]: With dead ends: 1171 [2022-07-20 04:07:48,028 INFO L226 Difference]: Without dead ends: 1169 [2022-07-20 04:07:48,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:07:48,029 INFO L413 NwaCegarLoop]: 1402 mSDtfsCounter, 2115 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:07:48,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2288 Valid, 2800 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 04:07:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2022-07-20 04:07:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1169. [2022-07-20 04:07:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 772 states have (on average 1.189119170984456) internal successors, (918), 801 states have internal predecessors, (918), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-20 04:07:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1510 transitions. [2022-07-20 04:07:48,101 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1510 transitions. Word has length 113 [2022-07-20 04:07:48,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:48,102 INFO L495 AbstractCegarLoop]: Abstraction has 1169 states and 1510 transitions. [2022-07-20 04:07:48,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (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-20 04:07:48,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1510 transitions. [2022-07-20 04:07:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-20 04:07:48,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:48,104 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:48,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 04:07:48,105 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:07:48,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:48,105 INFO L85 PathProgramCache]: Analyzing trace with hash -78006587, now seen corresponding path program 1 times [2022-07-20 04:07:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:48,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671042333] [2022-07-20 04:07:48,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:48,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:07:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:07:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:07:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:07:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:07:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:07:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:07:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:07:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:07:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:07:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:07:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:07:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:07:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:48,490 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:07:48,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:48,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671042333] [2022-07-20 04:07:48,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671042333] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:48,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:07:48,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:07:48,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020452272] [2022-07-20 04:07:48,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:48,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:07:48,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:48,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:07:48,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:07:48,493 INFO L87 Difference]: Start difference. First operand 1169 states and 1510 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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-20 04:07:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:50,767 INFO L93 Difference]: Finished difference Result 1169 states and 1510 transitions. [2022-07-20 04:07:50,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:07:50,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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 115 [2022-07-20 04:07:50,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:50,802 INFO L225 Difference]: With dead ends: 1169 [2022-07-20 04:07:50,802 INFO L226 Difference]: Without dead ends: 1167 [2022-07-20 04:07:50,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:07:50,803 INFO L413 NwaCegarLoop]: 1400 mSDtfsCounter, 2103 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2276 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 2422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:07:50,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2276 Valid, 2798 Invalid, 2422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-20 04:07:50,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2022-07-20 04:07:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1167. [2022-07-20 04:07:50,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 771 states have (on average 1.1880674448767834) internal successors, (916), 799 states have internal predecessors, (916), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-20 04:07:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1508 transitions. [2022-07-20 04:07:50,853 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1508 transitions. Word has length 115 [2022-07-20 04:07:50,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:50,854 INFO L495 AbstractCegarLoop]: Abstraction has 1167 states and 1508 transitions. [2022-07-20 04:07:50,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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-20 04:07:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1508 transitions. [2022-07-20 04:07:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-20 04:07:50,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:50,856 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:50,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 04:07:50,856 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:07:50,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:50,857 INFO L85 PathProgramCache]: Analyzing trace with hash -750920079, now seen corresponding path program 1 times [2022-07-20 04:07:50,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:50,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524094895] [2022-07-20 04:07:50,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:50,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:07:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:07:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:07:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:07:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:07:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:07:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:07:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:07:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:07:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:07:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:07:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:07:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:07:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:07:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:51,228 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:07:51,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:51,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524094895] [2022-07-20 04:07:51,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524094895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:51,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:07:51,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:07:51,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378726533] [2022-07-20 04:07:51,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:51,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:07:51,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:51,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:07:51,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:07:51,231 INFO L87 Difference]: Start difference. First operand 1167 states and 1508 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-20 04:07:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:53,348 INFO L93 Difference]: Finished difference Result 1167 states and 1508 transitions. [2022-07-20 04:07:53,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:07:53,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2022-07-20 04:07:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:53,354 INFO L225 Difference]: With dead ends: 1167 [2022-07-20 04:07:53,354 INFO L226 Difference]: Without dead ends: 1165 [2022-07-20 04:07:53,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:07:53,355 INFO L413 NwaCegarLoop]: 1398 mSDtfsCounter, 2099 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2271 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:07:53,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2271 Valid, 2796 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-20 04:07:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2022-07-20 04:07:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1165. [2022-07-20 04:07:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 770 states have (on average 1.187012987012987) internal successors, (914), 797 states have internal predecessors, (914), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-20 04:07:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1506 transitions. [2022-07-20 04:07:53,403 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1506 transitions. Word has length 121 [2022-07-20 04:07:53,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:53,403 INFO L495 AbstractCegarLoop]: Abstraction has 1165 states and 1506 transitions. [2022-07-20 04:07:53,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-20 04:07:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1506 transitions. [2022-07-20 04:07:53,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-20 04:07:53,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:53,405 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:53,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 04:07:53,406 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:07:53,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:53,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1499616254, now seen corresponding path program 1 times [2022-07-20 04:07:53,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:53,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571879494] [2022-07-20 04:07:53,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:53,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:07:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:07:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:07:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:07:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:07:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:07:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:07:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:07:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:07:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:07:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:07:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:07:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:07:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:07:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:07:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:07:53,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:53,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571879494] [2022-07-20 04:07:53,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571879494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:53,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:07:53,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:07:53,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071728723] [2022-07-20 04:07:53,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:53,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:07:53,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:53,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:07:53,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:07:53,816 INFO L87 Difference]: Start difference. First operand 1165 states and 1506 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 04:07:56,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:56,056 INFO L93 Difference]: Finished difference Result 1165 states and 1506 transitions. [2022-07-20 04:07:56,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:07:56,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2022-07-20 04:07:56,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:56,062 INFO L225 Difference]: With dead ends: 1165 [2022-07-20 04:07:56,063 INFO L226 Difference]: Without dead ends: 1163 [2022-07-20 04:07:56,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:07:56,064 INFO L413 NwaCegarLoop]: 1396 mSDtfsCounter, 2093 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2264 SdHoareTripleChecker+Valid, 2794 SdHoareTripleChecker+Invalid, 2418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:07:56,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2264 Valid, 2794 Invalid, 2418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-20 04:07:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-07-20 04:07:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1163. [2022-07-20 04:07:56,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 769 states have (on average 1.1859557867360209) internal successors, (912), 795 states have internal predecessors, (912), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-20 04:07:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1504 transitions. [2022-07-20 04:07:56,120 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1504 transitions. Word has length 127 [2022-07-20 04:07:56,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:56,121 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 1504 transitions. [2022-07-20 04:07:56,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 04:07:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1504 transitions. [2022-07-20 04:07:56,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-20 04:07:56,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:56,123 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:56,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 04:07:56,123 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:07:56,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:56,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1163685789, now seen corresponding path program 1 times [2022-07-20 04:07:56,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:56,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650885289] [2022-07-20 04:07:56,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:56,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:07:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:07:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:07:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:07:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:07:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:07:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:07:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:07:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:07:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:07:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:07:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:07:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:07:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:07:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:07:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:07:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:07:56,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:56,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650885289] [2022-07-20 04:07:56,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650885289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:56,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:07:56,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:07:56,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494582339] [2022-07-20 04:07:56,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:56,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:07:56,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:56,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:07:56,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:07:56,526 INFO L87 Difference]: Start difference. First operand 1163 states and 1504 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-20 04:07:58,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:58,990 INFO L93 Difference]: Finished difference Result 1163 states and 1504 transitions. [2022-07-20 04:07:58,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:07:58,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2022-07-20 04:07:58,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:58,995 INFO L225 Difference]: With dead ends: 1163 [2022-07-20 04:07:58,995 INFO L226 Difference]: Without dead ends: 1161 [2022-07-20 04:07:58,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:07:58,995 INFO L413 NwaCegarLoop]: 1394 mSDtfsCounter, 2087 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2257 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 2416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:07:58,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2257 Valid, 2792 Invalid, 2416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-20 04:07:59,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2022-07-20 04:07:59,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2022-07-20 04:07:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 768 states have (on average 1.1848958333333333) internal successors, (910), 793 states have internal predecessors, (910), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-20 04:07:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1502 transitions. [2022-07-20 04:07:59,052 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1502 transitions. Word has length 133 [2022-07-20 04:07:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:59,053 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1502 transitions. [2022-07-20 04:07:59,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-20 04:07:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1502 transitions. [2022-07-20 04:07:59,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-20 04:07:59,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:59,055 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:59,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 04:07:59,055 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:07:59,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:59,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1966142052, now seen corresponding path program 1 times [2022-07-20 04:07:59,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:59,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746311579] [2022-07-20 04:07:59,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:59,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:07:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:07:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:07:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:07:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:07:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:07:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:07:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:07:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:07:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:07:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:07:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:07:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:07:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:07:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:07:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:07:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:07:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:07:59,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:59,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746311579] [2022-07-20 04:07:59,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746311579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:59,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:07:59,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:07:59,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506929901] [2022-07-20 04:07:59,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:59,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:07:59,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:59,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:07:59,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:07:59,464 INFO L87 Difference]: Start difference. First operand 1161 states and 1502 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-20 04:08:01,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:08:01,818 INFO L93 Difference]: Finished difference Result 1161 states and 1502 transitions. [2022-07-20 04:08:01,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:08:01,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2022-07-20 04:08:01,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:08:01,823 INFO L225 Difference]: With dead ends: 1161 [2022-07-20 04:08:01,823 INFO L226 Difference]: Without dead ends: 1159 [2022-07-20 04:08:01,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:08:01,824 INFO L413 NwaCegarLoop]: 1392 mSDtfsCounter, 2081 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2250 SdHoareTripleChecker+Valid, 2790 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:08:01,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2250 Valid, 2790 Invalid, 2414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-20 04:08:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-07-20 04:08:01,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2022-07-20 04:08:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 767 states have (on average 1.1838331160365059) internal successors, (908), 791 states have internal predecessors, (908), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-20 04:08:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1500 transitions. [2022-07-20 04:08:01,881 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1500 transitions. Word has length 139 [2022-07-20 04:08:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:08:01,881 INFO L495 AbstractCegarLoop]: Abstraction has 1159 states and 1500 transitions. [2022-07-20 04:08:01,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-20 04:08:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1500 transitions. [2022-07-20 04:08:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-20 04:08:01,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:08:01,883 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:08:01,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 04:08:01,884 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:08:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:08:01,884 INFO L85 PathProgramCache]: Analyzing trace with hash 788971441, now seen corresponding path program 1 times [2022-07-20 04:08:01,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:08:01,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410434388] [2022-07-20 04:08:01,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:08:01,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:08:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:08:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:08:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:08:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:08:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:08:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:08:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:08:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:08:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:08:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:08:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:08:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:08:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:08:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:08:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:08:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:08:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:08:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:08:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:08:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:08:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:08:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:08:02,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:08:02,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410434388] [2022-07-20 04:08:02,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410434388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:08:02,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:08:02,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:08:02,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772216655] [2022-07-20 04:08:02,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:08:02,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:08:02,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:08:02,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:08:02,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:08:02,291 INFO L87 Difference]: Start difference. First operand 1159 states and 1500 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-20 04:08:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:08:04,560 INFO L93 Difference]: Finished difference Result 1159 states and 1500 transitions. [2022-07-20 04:08:04,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:08:04,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2022-07-20 04:08:04,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:08:04,566 INFO L225 Difference]: With dead ends: 1159 [2022-07-20 04:08:04,566 INFO L226 Difference]: Without dead ends: 1157 [2022-07-20 04:08:04,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:08:04,568 INFO L413 NwaCegarLoop]: 1390 mSDtfsCounter, 2075 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2243 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 2412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:08:04,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2243 Valid, 2788 Invalid, 2412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-20 04:08:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-07-20 04:08:04,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2022-07-20 04:08:04,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 766 states have (on average 1.1827676240208878) internal successors, (906), 789 states have internal predecessors, (906), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-20 04:08:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1498 transitions. [2022-07-20 04:08:04,625 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1498 transitions. Word has length 145 [2022-07-20 04:08:04,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:08:04,626 INFO L495 AbstractCegarLoop]: Abstraction has 1157 states and 1498 transitions. [2022-07-20 04:08:04,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-20 04:08:04,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1498 transitions. [2022-07-20 04:08:04,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-20 04:08:04,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:08:04,629 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:08:04,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 04:08:04,629 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:08:04,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:08:04,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1891115065, now seen corresponding path program 1 times [2022-07-20 04:08:04,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:08:04,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088076050] [2022-07-20 04:08:04,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:08:04,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:08:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:04,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:08:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:04,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:08:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:04,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:08:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:04,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:08:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:04,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:08:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:04,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:08:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:04,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:08:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:04,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:04,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:08:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:04,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:08:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:04,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:08:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:05,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:08:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:05,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:08:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:05,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:08:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:05,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:08:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:05,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:08:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:05,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:08:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:05,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:08:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:05,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:08:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:05,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:08:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:05,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:08:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:05,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:08:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:05,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:08:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:08:05,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:08:05,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088076050] [2022-07-20 04:08:05,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088076050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:08:05,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:08:05,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:08:05,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999547784] [2022-07-20 04:08:05,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:08:05,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:08:05,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:08:05,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:08:05,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:08:05,096 INFO L87 Difference]: Start difference. First operand 1157 states and 1498 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-20 04:08:07,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:08:07,355 INFO L93 Difference]: Finished difference Result 1157 states and 1498 transitions. [2022-07-20 04:08:07,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:08:07,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2022-07-20 04:08:07,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:08:07,360 INFO L225 Difference]: With dead ends: 1157 [2022-07-20 04:08:07,360 INFO L226 Difference]: Without dead ends: 1155 [2022-07-20 04:08:07,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:08:07,362 INFO L413 NwaCegarLoop]: 1388 mSDtfsCounter, 2069 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2236 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:08:07,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2236 Valid, 2786 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-20 04:08:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2022-07-20 04:08:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2022-07-20 04:08:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 765 states have (on average 1.1816993464052288) internal successors, (904), 787 states have internal predecessors, (904), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-20 04:08:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1496 transitions. [2022-07-20 04:08:07,426 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1496 transitions. Word has length 151 [2022-07-20 04:08:07,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:08:07,427 INFO L495 AbstractCegarLoop]: Abstraction has 1155 states and 1496 transitions. [2022-07-20 04:08:07,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-20 04:08:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1496 transitions. [2022-07-20 04:08:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-20 04:08:07,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:08:07,429 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:08:07,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 04:08:07,430 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:08:07,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:08:07,430 INFO L85 PathProgramCache]: Analyzing trace with hash -116230766, now seen corresponding path program 1 times [2022-07-20 04:08:07,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:08:07,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735768509] [2022-07-20 04:08:07,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:08:07,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:08:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:08:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:08:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:08:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:08:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:08:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:08:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:08:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:08:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:08:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:08:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:08:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:08:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:08:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:08:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:08:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:08:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:08:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:08:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:08:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:08:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:08:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:08:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:08:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:08:07,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:08:07,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735768509] [2022-07-20 04:08:07,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735768509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:08:07,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:08:07,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:08:07,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037908553] [2022-07-20 04:08:07,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:08:07,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:08:07,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:08:07,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:08:07,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:08:07,938 INFO L87 Difference]: Start difference. First operand 1155 states and 1496 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-20 04:08:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:08:10,485 INFO L93 Difference]: Finished difference Result 1155 states and 1496 transitions. [2022-07-20 04:08:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:08:10,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2022-07-20 04:08:10,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:08:10,490 INFO L225 Difference]: With dead ends: 1155 [2022-07-20 04:08:10,490 INFO L226 Difference]: Without dead ends: 1153 [2022-07-20 04:08:10,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:08:10,491 INFO L413 NwaCegarLoop]: 1386 mSDtfsCounter, 2063 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2229 SdHoareTripleChecker+Valid, 2784 SdHoareTripleChecker+Invalid, 2408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:08:10,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2229 Valid, 2784 Invalid, 2408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-20 04:08:10,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2022-07-20 04:08:10,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1153. [2022-07-20 04:08:10,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 764 states have (on average 1.1806282722513088) internal successors, (902), 785 states have internal predecessors, (902), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-20 04:08:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1494 transitions. [2022-07-20 04:08:10,553 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1494 transitions. Word has length 157 [2022-07-20 04:08:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:08:10,554 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1494 transitions. [2022-07-20 04:08:10,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-20 04:08:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1494 transitions. [2022-07-20 04:08:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-20 04:08:10,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:08:10,557 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:08:10,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 04:08:10,558 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:08:10,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:08:10,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1609989482, now seen corresponding path program 1 times [2022-07-20 04:08:10,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:08:10,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769313571] [2022-07-20 04:08:10,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:08:10,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:08:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:08:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:08:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:08:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:08:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:08:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:08:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:08:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:08:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:08:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:08:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:08:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:08:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 04:08:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:08:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:08:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 04:08:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2022-07-20 04:08:11,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:08:11,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769313571] [2022-07-20 04:08:11,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769313571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:08:11,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:08:11,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:08:11,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077669340] [2022-07-20 04:08:11,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:08:11,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:08:11,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:08:11,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:08:11,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:08:11,234 INFO L87 Difference]: Start difference. First operand 1153 states and 1494 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-20 04:08:14,669 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:08:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:08:16,876 INFO L93 Difference]: Finished difference Result 2366 states and 2983 transitions. [2022-07-20 04:08:16,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 04:08:16,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 196 [2022-07-20 04:08:16,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:08:16,884 INFO L225 Difference]: With dead ends: 2366 [2022-07-20 04:08:16,885 INFO L226 Difference]: Without dead ends: 1664 [2022-07-20 04:08:16,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-20 04:08:16,887 INFO L413 NwaCegarLoop]: 1405 mSDtfsCounter, 3004 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 1734 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3189 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 3617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1734 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:08:16,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3189 Valid, 3073 Invalid, 3617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1734 Valid, 1882 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-07-20 04:08:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2022-07-20 04:08:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1633. [2022-07-20 04:08:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1098 states have (on average 1.1848816029143898) internal successors, (1301), 1124 states have internal predecessors, (1301), 398 states have call successors, (398), 125 states have call predecessors, (398), 124 states have return successors, (396), 393 states have call predecessors, (396), 396 states have call successors, (396) [2022-07-20 04:08:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2095 transitions. [2022-07-20 04:08:16,992 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2095 transitions. Word has length 196 [2022-07-20 04:08:16,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:08:16,993 INFO L495 AbstractCegarLoop]: Abstraction has 1633 states and 2095 transitions. [2022-07-20 04:08:16,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-20 04:08:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2095 transitions. [2022-07-20 04:08:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-20 04:08:16,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:08:16,995 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:08:16,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 04:08:16,996 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:08:16,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:08:16,996 INFO L85 PathProgramCache]: Analyzing trace with hash -124157913, now seen corresponding path program 1 times [2022-07-20 04:08:16,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:08:16,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671269267] [2022-07-20 04:08:16,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:08:16,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:08:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:08:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:08:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:08:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:08:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:08:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:08:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:08:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:08:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:08:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:08:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:08:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:08:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:08:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:08:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:08:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:08:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:08:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:08:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:08:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:08:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:08:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:08:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:08:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:08:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:08:17,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:08:17,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671269267] [2022-07-20 04:08:17,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671269267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:08:17,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:08:17,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:08:17,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359496845] [2022-07-20 04:08:17,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:08:17,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:08:17,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:08:17,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:08:17,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:08:17,394 INFO L87 Difference]: Start difference. First operand 1633 states and 2095 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-20 04:08:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:08:19,990 INFO L93 Difference]: Finished difference Result 1633 states and 2095 transitions. [2022-07-20 04:08:19,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:08:19,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2022-07-20 04:08:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:08:20,000 INFO L225 Difference]: With dead ends: 1633 [2022-07-20 04:08:20,001 INFO L226 Difference]: Without dead ends: 1631 [2022-07-20 04:08:20,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:08:20,003 INFO L413 NwaCegarLoop]: 1384 mSDtfsCounter, 2057 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2222 SdHoareTripleChecker+Valid, 2782 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:08:20,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2222 Valid, 2782 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-20 04:08:20,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-07-20 04:08:20,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2022-07-20 04:08:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1097 states have (on average 1.1841385597082954) internal successors, (1299), 1122 states have internal predecessors, (1299), 398 states have call successors, (398), 125 states have call predecessors, (398), 124 states have return successors, (396), 393 states have call predecessors, (396), 396 states have call successors, (396) [2022-07-20 04:08:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2093 transitions. [2022-07-20 04:08:20,108 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2093 transitions. Word has length 163 [2022-07-20 04:08:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:08:20,108 INFO L495 AbstractCegarLoop]: Abstraction has 1631 states and 2093 transitions. [2022-07-20 04:08:20,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-20 04:08:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2093 transitions. [2022-07-20 04:08:20,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-20 04:08:20,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:08:20,111 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-20 04:08:20,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 04:08:20,111 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:08:20,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:08:20,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1153362727, now seen corresponding path program 1 times [2022-07-20 04:08:20,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:08:20,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935473030] [2022-07-20 04:08:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:08:20,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:08:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:08:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:08:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:08:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:08:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:08:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:08:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:08:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:08:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:08:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:08:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:08:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:08:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 04:08:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:08:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:08:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 04:08:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-20 04:08:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-07-20 04:08:20,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:08:20,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935473030] [2022-07-20 04:08:20,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935473030] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:08:20,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260266794] [2022-07-20 04:08:20,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:08:20,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:08:20,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:08:20,667 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-20 04:08:20,692 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-20 04:08:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:22,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 5415 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 04:08:22,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:08:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2022-07-20 04:08:22,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:08:22,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260266794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:08:22,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:08:22,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-20 04:08:22,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769321131] [2022-07-20 04:08:22,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:08:22,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 04:08:22,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:08:22,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 04:08:22,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:08:22,290 INFO L87 Difference]: Start difference. First operand 1631 states and 2093 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-20 04:08:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:08:22,441 INFO L93 Difference]: Finished difference Result 2376 states and 2995 transitions. [2022-07-20 04:08:22,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 04:08:22,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 202 [2022-07-20 04:08:22,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:08:22,450 INFO L225 Difference]: With dead ends: 2376 [2022-07-20 04:08:22,450 INFO L226 Difference]: Without dead ends: 1683 [2022-07-20 04:08:22,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:08:22,453 INFO L413 NwaCegarLoop]: 1549 mSDtfsCounter, 1435 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1435 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:08:22,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1435 Valid, 1616 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 04:08:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2022-07-20 04:08:22,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1680. [2022-07-20 04:08:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1126 states have (on average 1.1802841918294849) internal successors, (1329), 1154 states have internal predecessors, (1329), 413 states have call successors, (413), 131 states have call predecessors, (413), 130 states have return successors, (411), 406 states have call predecessors, (411), 411 states have call successors, (411) [2022-07-20 04:08:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2153 transitions. [2022-07-20 04:08:22,615 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2153 transitions. Word has length 202 [2022-07-20 04:08:22,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:08:22,615 INFO L495 AbstractCegarLoop]: Abstraction has 1680 states and 2153 transitions. [2022-07-20 04:08:22,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-20 04:08:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2153 transitions. [2022-07-20 04:08:22,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-20 04:08:22,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:08:22,618 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:08:22,661 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-20 04:08:22,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:08:22,844 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:08:22,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:08:22,844 INFO L85 PathProgramCache]: Analyzing trace with hash 915941882, now seen corresponding path program 1 times [2022-07-20 04:08:22,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:08:22,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816792898] [2022-07-20 04:08:22,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:08:22,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:08:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:08:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:08:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:08:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:08:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:08:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:08:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:08:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:08:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:08:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:08:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:08:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:08:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:08:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:08:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:08:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:08:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:08:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:08:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:08:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:08:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:08:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:08:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:08:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:08:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 04:08:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:08:23,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:08:23,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816792898] [2022-07-20 04:08:23,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816792898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:08:23,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:08:23,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:08:23,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920115797] [2022-07-20 04:08:23,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:08:23,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:08:23,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:08:23,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:08:23,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:08:23,217 INFO L87 Difference]: Start difference. First operand 1680 states and 2153 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 04:08:25,341 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:08:26,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:08:26,815 INFO L93 Difference]: Finished difference Result 1680 states and 2153 transitions. [2022-07-20 04:08:26,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:08:26,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2022-07-20 04:08:26,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:08:26,821 INFO L225 Difference]: With dead ends: 1680 [2022-07-20 04:08:26,821 INFO L226 Difference]: Without dead ends: 1678 [2022-07-20 04:08:26,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:08:26,822 INFO L413 NwaCegarLoop]: 1377 mSDtfsCounter, 2046 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2210 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 2403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:08:26,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2210 Valid, 2761 Invalid, 2403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-20 04:08:26,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2022-07-20 04:08:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1678. [2022-07-20 04:08:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1125 states have (on average 1.1795555555555555) internal successors, (1327), 1152 states have internal predecessors, (1327), 413 states have call successors, (413), 131 states have call predecessors, (413), 130 states have return successors, (411), 406 states have call predecessors, (411), 411 states have call successors, (411) [2022-07-20 04:08:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2151 transitions. [2022-07-20 04:08:26,942 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2151 transitions. Word has length 169 [2022-07-20 04:08:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:08:26,943 INFO L495 AbstractCegarLoop]: Abstraction has 1678 states and 2151 transitions. [2022-07-20 04:08:26,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 04:08:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2151 transitions. [2022-07-20 04:08:26,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-20 04:08:26,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:08:26,946 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:08:26,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 04:08:26,946 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:08:26,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:08:26,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1248913033, now seen corresponding path program 1 times [2022-07-20 04:08:26,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:08:26,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563157446] [2022-07-20 04:08:26,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:08:26,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:08:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:08:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:08:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:08:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:08:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:08:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:08:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:08:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:08:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:08:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:08:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:08:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:08:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:08:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:08:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:08:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:08:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:08:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:08:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:08:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:08:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:08:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:08:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:08:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:08:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 04:08:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 04:08:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:08:27,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:08:27,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563157446] [2022-07-20 04:08:27,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563157446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:08:27,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:08:27,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:08:27,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805604700] [2022-07-20 04:08:27,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:08:27,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:08:27,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:08:27,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:08:27,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:08:27,397 INFO L87 Difference]: Start difference. First operand 1678 states and 2151 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-20 04:08:31,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:08:31,530 INFO L93 Difference]: Finished difference Result 3075 states and 3907 transitions. [2022-07-20 04:08:31,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 04:08:31,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2022-07-20 04:08:31,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:08:31,545 INFO L225 Difference]: With dead ends: 3075 [2022-07-20 04:08:31,545 INFO L226 Difference]: Without dead ends: 3073 [2022-07-20 04:08:31,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-20 04:08:31,547 INFO L413 NwaCegarLoop]: 1722 mSDtfsCounter, 2900 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 2793 mSolverCounterSat, 1562 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3058 SdHoareTripleChecker+Valid, 3921 SdHoareTripleChecker+Invalid, 4355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1562 IncrementalHoareTripleChecker+Valid, 2793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:08:31,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3058 Valid, 3921 Invalid, 4355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1562 Valid, 2793 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-20 04:08:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2022-07-20 04:08:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 3040. [2022-07-20 04:08:31,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3040 states, 2046 states have (on average 1.1749755620723363) internal successors, (2404), 2085 states have internal predecessors, (2404), 733 states have call successors, (733), 252 states have call predecessors, (733), 251 states have return successors, (740), 722 states have call predecessors, (740), 731 states have call successors, (740) [2022-07-20 04:08:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 3040 states and 3877 transitions. [2022-07-20 04:08:31,791 INFO L78 Accepts]: Start accepts. Automaton has 3040 states and 3877 transitions. Word has length 175 [2022-07-20 04:08:31,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:08:31,792 INFO L495 AbstractCegarLoop]: Abstraction has 3040 states and 3877 transitions. [2022-07-20 04:08:31,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-20 04:08:31,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3040 states and 3877 transitions. [2022-07-20 04:08:31,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-20 04:08:31,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:08:31,794 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:08:31,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 04:08:31,795 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:08:31,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:08:31,795 INFO L85 PathProgramCache]: Analyzing trace with hash 175315228, now seen corresponding path program 1 times [2022-07-20 04:08:31,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:08:31,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864458900] [2022-07-20 04:08:31,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:08:31,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:08:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:08:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:08:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:08:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:08:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:08:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:08:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:08:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:08:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:08:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:08:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:08:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:08:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:08:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:08:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:08:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:08:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:08:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:08:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:08:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:08:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:08:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:08:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:08:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:08:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 04:08:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 04:08:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-20 04:08:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:08:32,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:08:32,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864458900] [2022-07-20 04:08:32,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864458900] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:08:32,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:08:32,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:08:32,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525379085] [2022-07-20 04:08:32,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:08:32,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:08:32,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:08:32,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:08:32,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:08:32,160 INFO L87 Difference]: Start difference. First operand 3040 states and 3877 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-20 04:08:35,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:08:35,333 INFO L93 Difference]: Finished difference Result 3040 states and 3877 transitions. [2022-07-20 04:08:35,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:08:35,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2022-07-20 04:08:35,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:08:35,346 INFO L225 Difference]: With dead ends: 3040 [2022-07-20 04:08:35,347 INFO L226 Difference]: Without dead ends: 3038 [2022-07-20 04:08:35,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:08:35,349 INFO L413 NwaCegarLoop]: 1375 mSDtfsCounter, 2040 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2202 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 2401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:08:35,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2202 Valid, 2759 Invalid, 2401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-20 04:08:35,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2022-07-20 04:08:35,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 3038. [2022-07-20 04:08:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3038 states, 2045 states have (on average 1.1745721271393643) internal successors, (2402), 2083 states have internal predecessors, (2402), 733 states have call successors, (733), 252 states have call predecessors, (733), 251 states have return successors, (740), 722 states have call predecessors, (740), 731 states have call successors, (740) [2022-07-20 04:08:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3038 states to 3038 states and 3875 transitions. [2022-07-20 04:08:35,561 INFO L78 Accepts]: Start accepts. Automaton has 3038 states and 3875 transitions. Word has length 181 [2022-07-20 04:08:35,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:08:35,562 INFO L495 AbstractCegarLoop]: Abstraction has 3038 states and 3875 transitions. [2022-07-20 04:08:35,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-20 04:08:35,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3038 states and 3875 transitions. [2022-07-20 04:08:35,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-20 04:08:35,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:08:35,565 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:08:35,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 04:08:35,565 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:08:35,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:08:35,566 INFO L85 PathProgramCache]: Analyzing trace with hash 247841666, now seen corresponding path program 1 times [2022-07-20 04:08:35,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:08:35,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383672159] [2022-07-20 04:08:35,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:08:35,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:08:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:08:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:08:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:08:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:08:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:08:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:08:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:08:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:08:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:08:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:08:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:08:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:08:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:08:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:08:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:08:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:08:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:08:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:08:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:08:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:08:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:08:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:08:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:08:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:08:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 04:08:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 04:08:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-20 04:08:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-20 04:08:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:35,946 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 04:08:35,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:08:35,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383672159] [2022-07-20 04:08:35,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383672159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:08:35,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:08:35,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:08:35,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55836157] [2022-07-20 04:08:35,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:08:35,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:08:35,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:08:35,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:08:35,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:08:35,949 INFO L87 Difference]: Start difference. First operand 3038 states and 3875 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-20 04:08:40,170 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:08:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:08:41,737 INFO L93 Difference]: Finished difference Result 5924 states and 7608 transitions. [2022-07-20 04:08:41,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 04:08:41,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2022-07-20 04:08:41,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:08:41,763 INFO L225 Difference]: With dead ends: 5924 [2022-07-20 04:08:41,763 INFO L226 Difference]: Without dead ends: 5710 [2022-07-20 04:08:41,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:08:41,770 INFO L413 NwaCegarLoop]: 1589 mSDtfsCounter, 2907 mSDsluCounter, 1861 mSDsCounter, 0 mSdLazyCounter, 3027 mSolverCounterSat, 1784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3048 SdHoareTripleChecker+Valid, 3450 SdHoareTripleChecker+Invalid, 4811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1784 IncrementalHoareTripleChecker+Valid, 3027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:08:41,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3048 Valid, 3450 Invalid, 4811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1784 Valid, 3027 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-20 04:08:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5710 states. [2022-07-20 04:08:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5710 to 5686. [2022-07-20 04:08:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5686 states, 3840 states have (on average 1.1778645833333334) internal successors, (4523), 3896 states have internal predecessors, (4523), 1362 states have call successors, (1362), 478 states have call predecessors, (1362), 475 states have return successors, (1442), 1345 states have call predecessors, (1442), 1358 states have call successors, (1442) [2022-07-20 04:08:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5686 states to 5686 states and 7327 transitions. [2022-07-20 04:08:42,094 INFO L78 Accepts]: Start accepts. Automaton has 5686 states and 7327 transitions. Word has length 187 [2022-07-20 04:08:42,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:08:42,094 INFO L495 AbstractCegarLoop]: Abstraction has 5686 states and 7327 transitions. [2022-07-20 04:08:42,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-20 04:08:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5686 states and 7327 transitions. [2022-07-20 04:08:42,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-07-20 04:08:42,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:08:42,097 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:08:42,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 04:08:42,098 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:08:42,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:08:42,098 INFO L85 PathProgramCache]: Analyzing trace with hash 573848340, now seen corresponding path program 1 times [2022-07-20 04:08:42,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:08:42,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994486973] [2022-07-20 04:08:42,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:08:42,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:08:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:08:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:08:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:08:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:08:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:08:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:08:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:08:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:08:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:08:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:08:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:08:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:08:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 04:08:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:08:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:08:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 04:08:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 04:08:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-20 04:08:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-20 04:08:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-20 04:08:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-20 04:08:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-20 04:08:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2022-07-20 04:08:42,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:08:42,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994486973] [2022-07-20 04:08:42,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994486973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:08:42,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:08:42,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 04:08:42,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344140225] [2022-07-20 04:08:42,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:08:42,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 04:08:42,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:08:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 04:08:42,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 04:08:42,771 INFO L87 Difference]: Start difference. First operand 5686 states and 7327 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 04:08:45,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:08:46,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:08:49,049 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:08:51,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:08:51,657 INFO L93 Difference]: Finished difference Result 11685 states and 15181 transitions. [2022-07-20 04:08:51,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 04:08:51,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 242 [2022-07-20 04:08:51,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:08:51,691 INFO L225 Difference]: With dead ends: 11685 [2022-07-20 04:08:51,691 INFO L226 Difference]: Without dead ends: 6104 [2022-07-20 04:08:51,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-20 04:08:51,717 INFO L413 NwaCegarLoop]: 1482 mSDtfsCounter, 1553 mSDsluCounter, 3056 mSDsCounter, 0 mSdLazyCounter, 3903 mSolverCounterSat, 1502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 4538 SdHoareTripleChecker+Invalid, 5405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1502 IncrementalHoareTripleChecker+Valid, 3903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:08:51,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 4538 Invalid, 5405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1502 Valid, 3903 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-07-20 04:08:51,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6104 states. [2022-07-20 04:08:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6104 to 5695. [2022-07-20 04:08:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5695 states, 3847 states have (on average 1.1775409409929816) internal successors, (4530), 3905 states have internal predecessors, (4530), 1362 states have call successors, (1362), 478 states have call predecessors, (1362), 477 states have return successors, (1446), 1345 states have call predecessors, (1446), 1358 states have call successors, (1446) [2022-07-20 04:08:52,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5695 states to 5695 states and 7338 transitions. [2022-07-20 04:08:52,196 INFO L78 Accepts]: Start accepts. Automaton has 5695 states and 7338 transitions. Word has length 242 [2022-07-20 04:08:52,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:08:52,197 INFO L495 AbstractCegarLoop]: Abstraction has 5695 states and 7338 transitions. [2022-07-20 04:08:52,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 04:08:52,197 INFO L276 IsEmpty]: Start isEmpty. Operand 5695 states and 7338 transitions. [2022-07-20 04:08:52,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-20 04:08:52,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:08:52,200 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:08:52,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 04:08:52,200 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:08:52,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:08:52,201 INFO L85 PathProgramCache]: Analyzing trace with hash -381389916, now seen corresponding path program 1 times [2022-07-20 04:08:52,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:08:52,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986674790] [2022-07-20 04:08:52,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:08:52,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:08:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:08:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:08:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:08:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:08:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:08:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:08:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:08:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:08:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:08:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:08:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:08:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:08:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 04:08:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:08:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:08:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 04:08:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-20 04:08:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-20 04:08:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 04:08:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-20 04:08:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-20 04:08:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-07-20 04:08:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-20 04:08:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2022-07-20 04:08:52,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:08:52,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986674790] [2022-07-20 04:08:52,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986674790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:08:52,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:08:52,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 04:08:52,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315553074] [2022-07-20 04:08:52,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:08:52,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 04:08:52,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:08:52,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 04:08:52,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 04:08:52,875 INFO L87 Difference]: Start difference. First operand 5695 states and 7338 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-20 04:08:58,299 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:09:00,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:09:00,515 INFO L93 Difference]: Finished difference Result 11338 states and 14637 transitions. [2022-07-20 04:09:00,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 04:09:00,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 263 [2022-07-20 04:09:00,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:09:00,548 INFO L225 Difference]: With dead ends: 11338 [2022-07-20 04:09:00,548 INFO L226 Difference]: Without dead ends: 5770 [2022-07-20 04:09:00,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:09:00,575 INFO L413 NwaCegarLoop]: 1364 mSDtfsCounter, 1283 mSDsluCounter, 2332 mSDsCounter, 0 mSdLazyCounter, 2791 mSolverCounterSat, 1156 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 3696 SdHoareTripleChecker+Invalid, 3948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1156 IncrementalHoareTripleChecker+Valid, 2791 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:09:00,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 3696 Invalid, 3948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1156 Valid, 2791 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2022-07-20 04:09:00,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2022-07-20 04:09:00,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5697. [2022-07-20 04:09:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5697 states, 3849 states have (on average 1.1774486879709016) internal successors, (4532), 3907 states have internal predecessors, (4532), 1362 states have call successors, (1362), 478 states have call predecessors, (1362), 477 states have return successors, (1446), 1345 states have call predecessors, (1446), 1358 states have call successors, (1446) [2022-07-20 04:09:00,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5697 states to 5697 states and 7340 transitions. [2022-07-20 04:09:00,995 INFO L78 Accepts]: Start accepts. Automaton has 5697 states and 7340 transitions. Word has length 263 [2022-07-20 04:09:00,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:09:00,996 INFO L495 AbstractCegarLoop]: Abstraction has 5697 states and 7340 transitions. [2022-07-20 04:09:00,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-20 04:09:00,996 INFO L276 IsEmpty]: Start isEmpty. Operand 5697 states and 7340 transitions. [2022-07-20 04:09:00,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-20 04:09:00,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:09:00,998 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:09:00,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 04:09:00,999 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:09:00,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:09:00,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1816089751, now seen corresponding path program 1 times [2022-07-20 04:09:01,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:09:01,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490762492] [2022-07-20 04:09:01,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:09:01,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:09:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:09:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:09:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:09:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:09:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:09:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:09:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:09:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:09:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:09:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:09:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:09:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:09:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 04:09:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:09:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:09:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 04:09:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-20 04:09:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-20 04:09:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 04:09:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-20 04:09:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-20 04:09:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-07-20 04:09:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-07-20 04:09:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:01,511 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2022-07-20 04:09:01,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:09:01,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490762492] [2022-07-20 04:09:01,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490762492] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:09:01,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843697351] [2022-07-20 04:09:01,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:09:01,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:09:01,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:09:01,514 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-20 04:09:01,546 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-20 04:09:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:03,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 5882 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 04:09:03,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:09:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2022-07-20 04:09:03,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:09:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2022-07-20 04:09:03,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843697351] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:09:03,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 04:09:03,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2022-07-20 04:09:03,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127343755] [2022-07-20 04:09:03,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 04:09:03,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 04:09:03,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:09:03,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 04:09:03,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-20 04:09:03,688 INFO L87 Difference]: Start difference. First operand 5697 states and 7340 transitions. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 9 states have internal predecessors, (113), 2 states have call successors, (40), 5 states have call predecessors, (40), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-20 04:09:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:09:11,059 INFO L93 Difference]: Finished difference Result 11347 states and 14648 transitions. [2022-07-20 04:09:11,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 04:09:11,060 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 9 states have internal predecessors, (113), 2 states have call successors, (40), 5 states have call predecessors, (40), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 267 [2022-07-20 04:09:11,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:09:11,081 INFO L225 Difference]: With dead ends: 11347 [2022-07-20 04:09:11,081 INFO L226 Difference]: Without dead ends: 5779 [2022-07-20 04:09:11,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 611 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-20 04:09:11,102 INFO L413 NwaCegarLoop]: 1365 mSDtfsCounter, 1307 mSDsluCounter, 3509 mSDsCounter, 0 mSdLazyCounter, 4604 mSolverCounterSat, 1161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 4874 SdHoareTripleChecker+Invalid, 5765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1161 IncrementalHoareTripleChecker+Valid, 4604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:09:11,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 4874 Invalid, 5765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1161 Valid, 4604 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-07-20 04:09:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5779 states. [2022-07-20 04:09:11,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5779 to 5709. [2022-07-20 04:09:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5709 states, 3861 states have (on average 1.176897176897177) internal successors, (4544), 3919 states have internal predecessors, (4544), 1362 states have call successors, (1362), 478 states have call predecessors, (1362), 477 states have return successors, (1446), 1345 states have call predecessors, (1446), 1358 states have call successors, (1446) [2022-07-20 04:09:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7352 transitions. [2022-07-20 04:09:11,451 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 7352 transitions. Word has length 267 [2022-07-20 04:09:11,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:09:11,451 INFO L495 AbstractCegarLoop]: Abstraction has 5709 states and 7352 transitions. [2022-07-20 04:09:11,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 9 states have internal predecessors, (113), 2 states have call successors, (40), 5 states have call predecessors, (40), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-20 04:09:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 7352 transitions. [2022-07-20 04:09:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-20 04:09:11,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:09:11,454 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-20 04:09:11,499 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-20 04:09:11,667 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,SelfDestructingSolverStorable25 [2022-07-20 04:09:11,668 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:09:11,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:09:11,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1770603785, now seen corresponding path program 1 times [2022-07-20 04:09:11,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:09:11,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439630664] [2022-07-20 04:09:11,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:09:11,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:09:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:09:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:09:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:09:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:09:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:09:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:09:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:09:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:09:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:09:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:09:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:09:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:09:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 04:09:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:09:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:09:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 04:09:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-20 04:09:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-20 04:09:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-20 04:09:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-20 04:09:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-20 04:09:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-20 04:09:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-20 04:09:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-20 04:09:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-20 04:09:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2022-07-20 04:09:12,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:09:12,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439630664] [2022-07-20 04:09:12,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439630664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:09:12,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:09:12,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:09:12,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526258347] [2022-07-20 04:09:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:09:12,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:09:12,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:09:12,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:09:12,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:09:12,420 INFO L87 Difference]: Start difference. First operand 5709 states and 7352 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (34), 7 states have call predecessors, (34), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-20 04:09:16,150 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:09:18,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:09:18,561 INFO L93 Difference]: Finished difference Result 7313 states and 9336 transitions. [2022-07-20 04:09:18,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 04:09:18,561 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (34), 7 states have call predecessors, (34), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 267 [2022-07-20 04:09:18,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:09:18,583 INFO L225 Difference]: With dead ends: 7313 [2022-07-20 04:09:18,584 INFO L226 Difference]: Without dead ends: 7311 [2022-07-20 04:09:18,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-07-20 04:09:18,587 INFO L413 NwaCegarLoop]: 1360 mSDtfsCounter, 3018 mSDsluCounter, 2394 mSDsCounter, 0 mSdLazyCounter, 3151 mSolverCounterSat, 1934 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3169 SdHoareTripleChecker+Valid, 3754 SdHoareTripleChecker+Invalid, 5085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1934 IncrementalHoareTripleChecker+Valid, 3151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:09:18,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3169 Valid, 3754 Invalid, 5085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1934 Valid, 3151 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-20 04:09:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7311 states. [2022-07-20 04:09:19,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7311 to 7187. [2022-07-20 04:09:19,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7187 states, 4892 states have (on average 1.1813164349959118) internal successors, (5779), 4949 states have internal predecessors, (5779), 1626 states have call successors, (1626), 662 states have call predecessors, (1626), 661 states have return successors, (1726), 1609 states have call predecessors, (1726), 1622 states have call successors, (1726) [2022-07-20 04:09:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7187 states to 7187 states and 9131 transitions. [2022-07-20 04:09:19,056 INFO L78 Accepts]: Start accepts. Automaton has 7187 states and 9131 transitions. Word has length 267 [2022-07-20 04:09:19,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:09:19,057 INFO L495 AbstractCegarLoop]: Abstraction has 7187 states and 9131 transitions. [2022-07-20 04:09:19,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (34), 7 states have call predecessors, (34), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-20 04:09:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 7187 states and 9131 transitions. [2022-07-20 04:09:19,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-20 04:09:19,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:09:19,059 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:09:19,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 04:09:19,060 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:09:19,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:09:19,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1859507128, now seen corresponding path program 2 times [2022-07-20 04:09:19,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:09:19,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164735286] [2022-07-20 04:09:19,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:09:19,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:09:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:09:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:09:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:09:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:09:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:09:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:09:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:09:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:09:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:09:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:09:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:09:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:09:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 04:09:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:09:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:09:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 04:09:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-20 04:09:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-20 04:09:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 04:09:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-20 04:09:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-20 04:09:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-20 04:09:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2022-07-20 04:09:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2022-07-20 04:09:19,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:09:19,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164735286] [2022-07-20 04:09:19,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164735286] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:09:19,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25880490] [2022-07-20 04:09:19,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 04:09:19,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:09:19,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:09:19,692 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-20 04:09:19,694 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-20 04:09:21,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 04:09:21,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 04:09:21,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 4181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 04:09:21,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:09:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2022-07-20 04:09:21,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:09:21,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25880490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:09:21,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:09:21,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2022-07-20 04:09:21,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752197546] [2022-07-20 04:09:21,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:09:21,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:09:21,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:09:21,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:09:21,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-20 04:09:21,546 INFO L87 Difference]: Start difference. First operand 7187 states and 9131 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (29), 1 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2022-07-20 04:09:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:09:22,696 INFO L93 Difference]: Finished difference Result 14218 states and 18299 transitions. [2022-07-20 04:09:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 04:09:22,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (29), 1 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) Word has length 279 [2022-07-20 04:09:22,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:09:22,722 INFO L225 Difference]: With dead ends: 14218 [2022-07-20 04:09:22,722 INFO L226 Difference]: Without dead ends: 7187 [2022-07-20 04:09:22,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-20 04:09:22,745 INFO L413 NwaCegarLoop]: 1473 mSDtfsCounter, 1324 mSDsluCounter, 3822 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 5295 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:09:22,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 5295 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 04:09:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7187 states. [2022-07-20 04:09:23,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7187 to 7187. [2022-07-20 04:09:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7187 states, 4892 states have (on average 1.178045789043336) internal successors, (5763), 4949 states have internal predecessors, (5763), 1626 states have call successors, (1626), 662 states have call predecessors, (1626), 661 states have return successors, (1726), 1609 states have call predecessors, (1726), 1622 states have call successors, (1726) [2022-07-20 04:09:23,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7187 states to 7187 states and 9115 transitions. [2022-07-20 04:09:23,216 INFO L78 Accepts]: Start accepts. Automaton has 7187 states and 9115 transitions. Word has length 279 [2022-07-20 04:09:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:09:23,216 INFO L495 AbstractCegarLoop]: Abstraction has 7187 states and 9115 transitions. [2022-07-20 04:09:23,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (29), 1 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2022-07-20 04:09:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 7187 states and 9115 transitions. [2022-07-20 04:09:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-20 04:09:23,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:09:23,219 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:09:23,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-20 04:09:23,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:09:23,419 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:09:23,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:09:23,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1859566710, now seen corresponding path program 1 times [2022-07-20 04:09:23,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:09:23,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908212662] [2022-07-20 04:09:23,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:09:23,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:09:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:09:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:09:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:09:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:09:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:09:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:09:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:09:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:09:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:09:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:09:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:09:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:09:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 04:09:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:09:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:09:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 04:09:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-20 04:09:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-20 04:09:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 04:09:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-20 04:09:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-20 04:09:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-20 04:09:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2022-07-20 04:09:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2022-07-20 04:09:23,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:09:23,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908212662] [2022-07-20 04:09:23,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908212662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:09:23,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:09:23,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 04:09:23,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288276313] [2022-07-20 04:09:23,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:09:23,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 04:09:23,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:09:23,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 04:09:23,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 04:09:23,976 INFO L87 Difference]: Start difference. First operand 7187 states and 9115 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-07-20 04:09:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:09:30,313 INFO L93 Difference]: Finished difference Result 7305 states and 9308 transitions. [2022-07-20 04:09:30,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 04:09:30,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 279 [2022-07-20 04:09:30,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:09:30,338 INFO L225 Difference]: With dead ends: 7305 [2022-07-20 04:09:30,338 INFO L226 Difference]: Without dead ends: 7303 [2022-07-20 04:09:30,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-20 04:09:30,343 INFO L413 NwaCegarLoop]: 1359 mSDtfsCounter, 1272 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 2764 mSolverCounterSat, 1156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 3702 SdHoareTripleChecker+Invalid, 3920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1156 IncrementalHoareTripleChecker+Valid, 2764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:09:30,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 3702 Invalid, 3920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1156 Valid, 2764 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-07-20 04:09:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states. [2022-07-20 04:09:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 7185. [2022-07-20 04:09:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7185 states, 4891 states have (on average 1.174810877121243) internal successors, (5746), 4947 states have internal predecessors, (5746), 1626 states have call successors, (1626), 662 states have call predecessors, (1626), 661 states have return successors, (1726), 1609 states have call predecessors, (1726), 1622 states have call successors, (1726) [2022-07-20 04:09:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7185 states to 7185 states and 9098 transitions. [2022-07-20 04:09:30,873 INFO L78 Accepts]: Start accepts. Automaton has 7185 states and 9098 transitions. Word has length 279 [2022-07-20 04:09:30,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:09:30,873 INFO L495 AbstractCegarLoop]: Abstraction has 7185 states and 9098 transitions. [2022-07-20 04:09:30,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-07-20 04:09:30,874 INFO L276 IsEmpty]: Start isEmpty. Operand 7185 states and 9098 transitions. [2022-07-20 04:09:30,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-07-20 04:09:30,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:09:30,876 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:09:30,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-20 04:09:30,876 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:09:30,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:09:30,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1346050784, now seen corresponding path program 1 times [2022-07-20 04:09:30,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:09:30,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138001298] [2022-07-20 04:09:30,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:09:30,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:09:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:09:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:09:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:09:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:09:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:09:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:09:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:09:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:09:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:09:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:09:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:09:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:09:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 04:09:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:09:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:09:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 04:09:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-20 04:09:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-20 04:09:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 04:09:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-20 04:09:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-20 04:09:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-20 04:09:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-07-20 04:09:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2022-07-20 04:09:31,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:09:31,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138001298] [2022-07-20 04:09:31,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138001298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:09:31,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:09:31,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:09:31,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225676752] [2022-07-20 04:09:31,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:09:31,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:09:31,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:09:31,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:09:31,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:09:31,361 INFO L87 Difference]: Start difference. First operand 7185 states and 9098 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-20 04:09:34,680 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:09:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:09:36,062 INFO L93 Difference]: Finished difference Result 14298 states and 18377 transitions. [2022-07-20 04:09:36,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:09:36,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 286 [2022-07-20 04:09:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:09:36,091 INFO L225 Difference]: With dead ends: 14298 [2022-07-20 04:09:36,091 INFO L226 Difference]: Without dead ends: 7269 [2022-07-20 04:09:36,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 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-20 04:09:36,114 INFO L413 NwaCegarLoop]: 1355 mSDtfsCounter, 2256 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 1380 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2428 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 2374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1380 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:09:36,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2428 Valid, 2522 Invalid, 2374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1380 Valid, 993 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-07-20 04:09:36,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7269 states. [2022-07-20 04:09:36,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7269 to 7151. [2022-07-20 04:09:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7151 states, 4858 states have (on average 1.169411280362289) internal successors, (5681), 4913 states have internal predecessors, (5681), 1626 states have call successors, (1626), 662 states have call predecessors, (1626), 661 states have return successors, (1726), 1609 states have call predecessors, (1726), 1622 states have call successors, (1726) [2022-07-20 04:09:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 9033 transitions. [2022-07-20 04:09:36,699 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 9033 transitions. Word has length 286 [2022-07-20 04:09:36,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:09:36,699 INFO L495 AbstractCegarLoop]: Abstraction has 7151 states and 9033 transitions. [2022-07-20 04:09:36,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-20 04:09:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 9033 transitions. [2022-07-20 04:09:36,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-07-20 04:09:36,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:09:36,702 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:09:36,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-20 04:09:36,702 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:09:36,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:09:36,703 INFO L85 PathProgramCache]: Analyzing trace with hash -881185240, now seen corresponding path program 1 times [2022-07-20 04:09:36,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:09:36,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393329968] [2022-07-20 04:09:36,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:09:36,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:09:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:36,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:09:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:36,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:09:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:36,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:09:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:36,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:09:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:09:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:36,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:36,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:36,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:36,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:09:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:36,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:36,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:36,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:36,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:09:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:36,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:36,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:36,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:36,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:09:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:09:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:09:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:09:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:09:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 04:09:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:09:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:09:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 04:09:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-20 04:09:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-20 04:09:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-20 04:09:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-20 04:09:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-20 04:09:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-20 04:09:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-20 04:09:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-20 04:09:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-20 04:09:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-07-20 04:09:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-07-20 04:09:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-20 04:09:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 04:09:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-20 04:09:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2022-07-20 04:09:37,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:09:37,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393329968] [2022-07-20 04:09:37,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393329968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:09:37,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:09:37,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 04:09:37,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137345034] [2022-07-20 04:09:37,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:09:37,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 04:09:37,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:09:37,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 04:09:37,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:09:37,148 INFO L87 Difference]: Start difference. First operand 7151 states and 9033 transitions. Second operand has 10 states, 9 states have (on average 10.88888888888889) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (38), 8 states have call predecessors, (38), 2 states have return successors, (35), 2 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-20 04:09:41,262 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:09:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:09:44,488 INFO L93 Difference]: Finished difference Result 7283 states and 9243 transitions. [2022-07-20 04:09:44,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 04:09:44,492 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.88888888888889) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (38), 8 states have call predecessors, (38), 2 states have return successors, (35), 2 states have call predecessors, (35), 3 states have call successors, (35) Word has length 299 [2022-07-20 04:09:44,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:09:44,522 INFO L225 Difference]: With dead ends: 7283 [2022-07-20 04:09:44,522 INFO L226 Difference]: Without dead ends: 7281 [2022-07-20 04:09:44,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2022-07-20 04:09:44,528 INFO L413 NwaCegarLoop]: 1523 mSDtfsCounter, 2214 mSDsluCounter, 3276 mSDsCounter, 0 mSdLazyCounter, 4416 mSolverCounterSat, 2101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2226 SdHoareTripleChecker+Valid, 4799 SdHoareTripleChecker+Invalid, 6517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2101 IncrementalHoareTripleChecker+Valid, 4416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:09:44,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2226 Valid, 4799 Invalid, 6517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2101 Valid, 4416 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-07-20 04:09:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7281 states. [2022-07-20 04:09:45,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7281 to 7149. [2022-07-20 04:09:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7149 states, 4857 states have (on average 1.167799052913321) internal successors, (5672), 4911 states have internal predecessors, (5672), 1626 states have call successors, (1626), 662 states have call predecessors, (1626), 661 states have return successors, (1726), 1609 states have call predecessors, (1726), 1622 states have call successors, (1726) [2022-07-20 04:09:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7149 states to 7149 states and 9024 transitions. [2022-07-20 04:09:45,054 INFO L78 Accepts]: Start accepts. Automaton has 7149 states and 9024 transitions. Word has length 299 [2022-07-20 04:09:45,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:09:45,055 INFO L495 AbstractCegarLoop]: Abstraction has 7149 states and 9024 transitions. [2022-07-20 04:09:45,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.88888888888889) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (38), 8 states have call predecessors, (38), 2 states have return successors, (35), 2 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-20 04:09:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 7149 states and 9024 transitions. [2022-07-20 04:09:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2022-07-20 04:09:45,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:09:45,059 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:09:45,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-20 04:09:45,060 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:09:45,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:09:45,060 INFO L85 PathProgramCache]: Analyzing trace with hash 95962582, now seen corresponding path program 1 times [2022-07-20 04:09:45,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:09:45,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809942112] [2022-07-20 04:09:45,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:09:45,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:09:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:09:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:09:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:09:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:09:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:09:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:09:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:09:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:09:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:09:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:09:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:09:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:09:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 04:09:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:09:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:09:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 04:09:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-20 04:09:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-20 04:09:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-20 04:09:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-20 04:09:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-20 04:09:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-20 04:09:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-20 04:09:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-20 04:09:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-20 04:09:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-20 04:09:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-20 04:09:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:09:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:09:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:09:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:09:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:09:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:09:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:09:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:09:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:09:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2022-07-20 04:09:45,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:09:45,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809942112] [2022-07-20 04:09:45,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809942112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:09:45,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:09:45,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-20 04:09:45,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073893221] [2022-07-20 04:09:45,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:09:45,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 04:09:45,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:09:45,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 04:09:45,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-20 04:09:45,822 INFO L87 Difference]: Start difference. First operand 7149 states and 9024 transitions. Second operand has 13 states, 12 states have (on average 11.25) internal successors, (135), 6 states have internal predecessors, (135), 3 states have call successors, (46), 7 states have call predecessors, (46), 3 states have return successors, (44), 4 states have call predecessors, (44), 3 states have call successors, (44) [2022-07-20 04:09:51,918 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:09:56,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:09:57,648 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:10:02,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:10:02,086 INFO L93 Difference]: Finished difference Result 12986 states and 16332 transitions. [2022-07-20 04:10:02,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 04:10:02,087 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 11.25) internal successors, (135), 6 states have internal predecessors, (135), 3 states have call successors, (46), 7 states have call predecessors, (46), 3 states have return successors, (44), 4 states have call predecessors, (44), 3 states have call successors, (44) Word has length 342 [2022-07-20 04:10:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:10:02,106 INFO L225 Difference]: With dead ends: 12986 [2022-07-20 04:10:02,106 INFO L226 Difference]: Without dead ends: 7471 [2022-07-20 04:10:02,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2022-07-20 04:10:02,119 INFO L413 NwaCegarLoop]: 1313 mSDtfsCounter, 1523 mSDsluCounter, 5376 mSDsCounter, 0 mSdLazyCounter, 7430 mSolverCounterSat, 1569 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 6689 SdHoareTripleChecker+Invalid, 8999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1569 IncrementalHoareTripleChecker+Valid, 7430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:10:02,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 6689 Invalid, 8999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1569 Valid, 7430 Invalid, 0 Unknown, 0 Unchecked, 15.4s Time] [2022-07-20 04:10:02,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7471 states. [2022-07-20 04:10:02,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7471 to 7199. [2022-07-20 04:10:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7199 states, 4890 states have (on average 1.1666666666666667) internal successors, (5705), 4945 states have internal predecessors, (5705), 1642 states have call successors, (1642), 662 states have call predecessors, (1642), 662 states have return successors, (1745), 1625 states have call predecessors, (1745), 1638 states have call successors, (1745) [2022-07-20 04:10:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7199 states to 7199 states and 9092 transitions. [2022-07-20 04:10:02,636 INFO L78 Accepts]: Start accepts. Automaton has 7199 states and 9092 transitions. Word has length 342 [2022-07-20 04:10:02,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:10:02,637 INFO L495 AbstractCegarLoop]: Abstraction has 7199 states and 9092 transitions. [2022-07-20 04:10:02,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 11.25) internal successors, (135), 6 states have internal predecessors, (135), 3 states have call successors, (46), 7 states have call predecessors, (46), 3 states have return successors, (44), 4 states have call predecessors, (44), 3 states have call successors, (44) [2022-07-20 04:10:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 7199 states and 9092 transitions. [2022-07-20 04:10:02,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2022-07-20 04:10:02,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:10:02,642 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:10:02,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-20 04:10:02,642 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:10:02,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:10:02,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2041872285, now seen corresponding path program 1 times [2022-07-20 04:10:02,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:10:02,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593325526] [2022-07-20 04:10:02,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:10:02,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:10:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:10:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:10:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:10:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:10:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:10:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:10:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:10:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:10:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:10:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:10:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:10:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:10:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 04:10:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:10:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:10:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:03,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 04:10:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-20 04:10:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-20 04:10:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-20 04:10:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-20 04:10:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-20 04:10:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-20 04:10:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-20 04:10:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-20 04:10:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-20 04:10:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-20 04:10:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-20 04:10:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:10:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:10:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:10:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:10:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:10:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2022-07-20 04:10:04,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:10:04,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593325526] [2022-07-20 04:10:04,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593325526] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:10:04,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76598727] [2022-07-20 04:10:04,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:10:04,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:10:04,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:10:04,130 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-20 04:10:04,132 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-20 04:10:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:06,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 6156 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-20 04:10:06,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:10:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2022-07-20 04:10:06,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:10:06,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76598727] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:10:06,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:10:06,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 24 [2022-07-20 04:10:06,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612142455] [2022-07-20 04:10:06,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:10:06,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 04:10:06,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:10:06,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 04:10:06,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2022-07-20 04:10:06,271 INFO L87 Difference]: Start difference. First operand 7199 states and 9092 transitions. Second operand has 14 states, 13 states have (on average 10.846153846153847) internal successors, (141), 13 states have internal predecessors, (141), 6 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) [2022-07-20 04:10:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:10:07,198 INFO L93 Difference]: Finished difference Result 8765 states and 10962 transitions. [2022-07-20 04:10:07,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 04:10:07,199 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 10.846153846153847) internal successors, (141), 13 states have internal predecessors, (141), 6 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) Word has length 343 [2022-07-20 04:10:07,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:10:07,217 INFO L225 Difference]: With dead ends: 8765 [2022-07-20 04:10:07,218 INFO L226 Difference]: Without dead ends: 7196 [2022-07-20 04:10:07,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2022-07-20 04:10:07,223 INFO L413 NwaCegarLoop]: 1437 mSDtfsCounter, 38 mSDsluCounter, 17148 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 18585 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:10:07,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 18585 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 04:10:07,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7196 states. [2022-07-20 04:10:07,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7196 to 7196. [2022-07-20 04:10:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7196 states, 4887 states have (on average 1.1663597298956414) internal successors, (5700), 4942 states have internal predecessors, (5700), 1642 states have call successors, (1642), 662 states have call predecessors, (1642), 662 states have return successors, (1745), 1625 states have call predecessors, (1745), 1638 states have call successors, (1745) [2022-07-20 04:10:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7196 states to 7196 states and 9087 transitions. [2022-07-20 04:10:07,727 INFO L78 Accepts]: Start accepts. Automaton has 7196 states and 9087 transitions. Word has length 343 [2022-07-20 04:10:07,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:10:07,727 INFO L495 AbstractCegarLoop]: Abstraction has 7196 states and 9087 transitions. [2022-07-20 04:10:07,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 10.846153846153847) internal successors, (141), 13 states have internal predecessors, (141), 6 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) [2022-07-20 04:10:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 7196 states and 9087 transitions. [2022-07-20 04:10:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2022-07-20 04:10:07,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:10:07,732 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 10, 10, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:10:07,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-20 04:10:07,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:10:07,933 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:10:07,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:10:07,934 INFO L85 PathProgramCache]: Analyzing trace with hash -848962049, now seen corresponding path program 1 times [2022-07-20 04:10:07,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:10:07,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022199516] [2022-07-20 04:10:07,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:10:07,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:10:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:10:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:10:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:10:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:10:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:10:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:10:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:10:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:10:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:10:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:10:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:10:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:10:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 04:10:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:10:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:10:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 04:10:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-20 04:10:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-20 04:10:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 04:10:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-20 04:10:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-20 04:10:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-20 04:10:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-07-20 04:10:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:10:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-20 04:10:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-07-20 04:10:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2022-07-20 04:10:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-07-20 04:10:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-07-20 04:10:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-07-20 04:10:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-07-20 04:10:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2022-07-20 04:10:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2022-07-20 04:10:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-07-20 04:10:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-20 04:10:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:10:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2022-07-20 04:10:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-07-20 04:10:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2022-07-20 04:10:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 426 [2022-07-20 04:10:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2022-07-20 04:10:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2022-07-20 04:10:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-20 04:10:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 458 [2022-07-20 04:10:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 463 [2022-07-20 04:10:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:10:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 951 trivial. 0 not checked. [2022-07-20 04:10:08,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:10:08,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022199516] [2022-07-20 04:10:08,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022199516] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:10:08,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370508552] [2022-07-20 04:10:08,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:10:08,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:10:08,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:10:08,859 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-20 04:10:08,887 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-20 04:10:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:11,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 7605 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-20 04:10:11,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:10:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-07-20 04:10:11,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:10:11,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370508552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:10:11,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:10:11,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2022-07-20 04:10:11,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559346846] [2022-07-20 04:10:11,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:10:11,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:10:11,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:10:11,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:10:11,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-07-20 04:10:11,256 INFO L87 Difference]: Start difference. First operand 7196 states and 9087 transitions. Second operand has 6 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 3 states have call successors, (57), 2 states have call predecessors, (57), 3 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2022-07-20 04:10:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:10:11,817 INFO L93 Difference]: Finished difference Result 14307 states and 18062 transitions. [2022-07-20 04:10:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 04:10:11,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 3 states have call successors, (57), 2 states have call predecessors, (57), 3 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) Word has length 493 [2022-07-20 04:10:11,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:10:11,835 INFO L225 Difference]: With dead ends: 14307 [2022-07-20 04:10:11,835 INFO L226 Difference]: Without dead ends: 7196 [2022-07-20 04:10:11,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 636 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2022-07-20 04:10:11,848 INFO L413 NwaCegarLoop]: 1434 mSDtfsCounter, 368 mSDsluCounter, 5172 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 6606 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:10:11,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 6606 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 04:10:11,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7196 states. [2022-07-20 04:10:12,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7196 to 7196. [2022-07-20 04:10:12,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7196 states, 4887 states have (on average 1.1661551053816248) internal successors, (5699), 4942 states have internal predecessors, (5699), 1642 states have call successors, (1642), 662 states have call predecessors, (1642), 662 states have return successors, (1745), 1625 states have call predecessors, (1745), 1638 states have call successors, (1745) [2022-07-20 04:10:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7196 states to 7196 states and 9086 transitions. [2022-07-20 04:10:12,345 INFO L78 Accepts]: Start accepts. Automaton has 7196 states and 9086 transitions. Word has length 493 [2022-07-20 04:10:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:10:12,345 INFO L495 AbstractCegarLoop]: Abstraction has 7196 states and 9086 transitions. [2022-07-20 04:10:12,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 3 states have call successors, (57), 2 states have call predecessors, (57), 3 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2022-07-20 04:10:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 7196 states and 9086 transitions. [2022-07-20 04:10:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2022-07-20 04:10:12,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:10:12,350 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:10:12,391 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-20 04:10:12,568 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,SelfDestructingSolverStorable33 [2022-07-20 04:10:12,568 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:10:12,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:10:12,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1321697722, now seen corresponding path program 1 times [2022-07-20 04:10:12,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:10:12,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625171032] [2022-07-20 04:10:12,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:10:12,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:10:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:10:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:10:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:10:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:10:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:10:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:10:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:10:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:10:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:10:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:10:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:10:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:10:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 04:10:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:10:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:10:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 04:10:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-20 04:10:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-20 04:10:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 04:10:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-20 04:10:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-20 04:10:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-20 04:10:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-20 04:10:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-20 04:10:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-20 04:10:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-20 04:10:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2022-07-20 04:10:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:10:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-07-20 04:10:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2022-07-20 04:10:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-07-20 04:10:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2022-07-20 04:10:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-07-20 04:10:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2022-07-20 04:10:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-07-20 04:10:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-20 04:10:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2022-07-20 04:10:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:10:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2022-07-20 04:10:13,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:10:13,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625171032] [2022-07-20 04:10:13,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625171032] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:10:13,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102179196] [2022-07-20 04:10:13,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:10:13,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:10:13,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:10:13,346 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-20 04:10:13,348 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-20 04:10:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:15,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 6891 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-20 04:10:15,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:10:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2022-07-20 04:10:15,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:10:15,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102179196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:10:15,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:10:15,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-07-20 04:10:15,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377084792] [2022-07-20 04:10:15,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:10:15,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:10:15,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:10:15,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:10:15,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-07-20 04:10:15,694 INFO L87 Difference]: Start difference. First operand 7196 states and 9086 transitions. Second operand has 9 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 4 states have call successors, (49), 2 states have call predecessors, (49), 3 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2022-07-20 04:10:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:10:16,637 INFO L93 Difference]: Finished difference Result 14303 states and 18055 transitions. [2022-07-20 04:10:16,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 04:10:16,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 4 states have call successors, (49), 2 states have call predecessors, (49), 3 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) Word has length 421 [2022-07-20 04:10:16,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:10:16,663 INFO L225 Difference]: With dead ends: 14303 [2022-07-20 04:10:16,663 INFO L226 Difference]: Without dead ends: 7196 [2022-07-20 04:10:16,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2022-07-20 04:10:16,680 INFO L413 NwaCegarLoop]: 1431 mSDtfsCounter, 730 mSDsluCounter, 8920 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 10351 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:10:16,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 10351 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 04:10:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7196 states. [2022-07-20 04:10:17,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7196 to 7196. [2022-07-20 04:10:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7196 states, 4887 states have (on average 1.165950480867608) internal successors, (5698), 4942 states have internal predecessors, (5698), 1642 states have call successors, (1642), 662 states have call predecessors, (1642), 662 states have return successors, (1745), 1625 states have call predecessors, (1745), 1638 states have call successors, (1745) [2022-07-20 04:10:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7196 states to 7196 states and 9085 transitions. [2022-07-20 04:10:17,089 INFO L78 Accepts]: Start accepts. Automaton has 7196 states and 9085 transitions. Word has length 421 [2022-07-20 04:10:17,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:10:17,090 INFO L495 AbstractCegarLoop]: Abstraction has 7196 states and 9085 transitions. [2022-07-20 04:10:17,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 4 states have call successors, (49), 2 states have call predecessors, (49), 3 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2022-07-20 04:10:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 7196 states and 9085 transitions. [2022-07-20 04:10:17,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2022-07-20 04:10:17,094 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:10:17,095 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 10, 10, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:10:17,130 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-20 04:10:17,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:10:17,301 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:10:17,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:10:17,301 INFO L85 PathProgramCache]: Analyzing trace with hash 624684712, now seen corresponding path program 1 times [2022-07-20 04:10:17,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:10:17,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625864903] [2022-07-20 04:10:17,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:10:17,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:10:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:10:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:10:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:10:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:10:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:10:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:10:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:10:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:10:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:10:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:10:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:10:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:10:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 04:10:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:10:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:17,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:10:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 04:10:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-20 04:10:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:10:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:10:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-20 04:10:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 04:10:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-20 04:10:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-20 04:10:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-20 04:10:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-07-20 04:10:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:10:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-20 04:10:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-07-20 04:10:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-07-20 04:10:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-07-20 04:10:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-07-20 04:10:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-07-20 04:10:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2022-07-20 04:10:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2022-07-20 04:10:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2022-07-20 04:10:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2022-07-20 04:10:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2022-07-20 04:10:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-07-20 04:10:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:10:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2022-07-20 04:10:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 410 [2022-07-20 04:10:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 417 [2022-07-20 04:10:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 434 [2022-07-20 04:10:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 439 [2022-07-20 04:10:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 444 [2022-07-20 04:10:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2022-07-20 04:10:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 466 [2022-07-20 04:10:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 471 [2022-07-20 04:10:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:10:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:10:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 956 trivial. 0 not checked. [2022-07-20 04:10:18,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:10:18,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625864903] [2022-07-20 04:10:18,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625864903] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:10:18,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840683418] [2022-07-20 04:10:18,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:10:18,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:10:18,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:10:18,204 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-20 04:10:18,205 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-20 04:10:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:10:20,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 7753 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-20 04:10:20,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:10:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 309 proven. 2 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2022-07-20 04:10:20,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:10:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2022-07-20 04:10:21,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840683418] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:10:21,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 04:10:21,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 6] total 23 [2022-07-20 04:10:21,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927529196] [2022-07-20 04:10:21,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 04:10:21,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 04:10:21,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:10:21,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 04:10:21,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2022-07-20 04:10:21,130 INFO L87 Difference]: Start difference. First operand 7196 states and 9085 transitions. Second operand has 23 states, 20 states have (on average 14.1) internal successors, (282), 15 states have internal predecessors, (282), 5 states have call successors, (117), 8 states have call predecessors, (117), 4 states have return successors, (100), 4 states have call predecessors, (100), 5 states have call successors, (100) [2022-07-20 04:10:32,979 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:10:35,566 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:10:37,581 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []