./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 53e062e1035ae1f01c2e809595599fa2661e1ae14b245da0f28d018a9f398780 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 04:20:25,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 04:20:25,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 04:20:25,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 04:20:25,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 04:20:25,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 04:20:25,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 04:20:25,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 04:20:25,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 04:20:25,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 04:20:25,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 04:20:25,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 04:20:25,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 04:20:25,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 04:20:25,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 04:20:25,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 04:20:25,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 04:20:25,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 04:20:25,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 04:20:25,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 04:20:25,684 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 04:20:25,686 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 04:20:25,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 04:20:25,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 04:20:25,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 04:20:25,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 04:20:25,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 04:20:25,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 04:20:25,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 04:20:25,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 04:20:25,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 04:20:25,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 04:20:25,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 04:20:25,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 04:20:25,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 04:20:25,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 04:20:25,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 04:20:25,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 04:20:25,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 04:20:25,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 04:20:25,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 04:20:25,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 04:20:25,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 04:20:25,727 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 04:20:25,727 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 04:20:25,728 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 04:20:25,728 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 04:20:25,728 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 04:20:25,728 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 04:20:25,729 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 04:20:25,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 04:20:25,729 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 04:20:25,730 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 04:20:25,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 04:20:25,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 04:20:25,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 04:20:25,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 04:20:25,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 04:20:25,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 04:20:25,731 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 04:20:25,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 04:20:25,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 04:20:25,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 04:20:25,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 04:20:25,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:20:25,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 04:20:25,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 04:20:25,733 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 04:20:25,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 04:20:25,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 04:20:25,733 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 04:20:25,733 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 04:20:25,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 04:20:25,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 53e062e1035ae1f01c2e809595599fa2661e1ae14b245da0f28d018a9f398780 [2022-07-23 04:20:25,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 04:20:25,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 04:20:25,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 04:20:25,985 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 04:20:25,985 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 04:20:25,986 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i [2022-07-23 04:20:26,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e999a1285/ea52e808fa1b449a801ff26b4beb0aea/FLAG7542218db [2022-07-23 04:20:26,727 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 04:20:26,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i [2022-07-23 04:20:26,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e999a1285/ea52e808fa1b449a801ff26b4beb0aea/FLAG7542218db [2022-07-23 04:20:26,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e999a1285/ea52e808fa1b449a801ff26b4beb0aea [2022-07-23 04:20:26,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 04:20:26,851 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 04:20:26,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 04:20:26,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 04:20:26,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 04:20:26,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:20:26" (1/1) ... [2022-07-23 04:20:26,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a1aad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:20:26, skipping insertion in model container [2022-07-23 04:20:26,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:20:26" (1/1) ... [2022-07-23 04:20:26,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 04:20:26,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 04:20:29,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[393566,393579] [2022-07-23 04:20:29,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[393711,393724] [2022-07-23 04:20:29,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[393857,393870] [2022-07-23 04:20:29,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394022,394035] [2022-07-23 04:20:29,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394180,394193] [2022-07-23 04:20:29,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394338,394351] [2022-07-23 04:20:29,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394496,394509] [2022-07-23 04:20:29,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394656,394669] [2022-07-23 04:20:29,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394815,394828] [2022-07-23 04:20:29,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394954,394967] [2022-07-23 04:20:29,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[395096,395109] [2022-07-23 04:20:29,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[395245,395258] [2022-07-23 04:20:29,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[395384,395397] [2022-07-23 04:20:29,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[395539,395552] [2022-07-23 04:20:29,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[395699,395712] [2022-07-23 04:20:29,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[395850,395863] [2022-07-23 04:20:29,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396001,396014] [2022-07-23 04:20:29,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396153,396166] [2022-07-23 04:20:29,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396302,396315] [2022-07-23 04:20:29,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396450,396463] [2022-07-23 04:20:29,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396607,396620] [2022-07-23 04:20:29,448 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396756,396769] [2022-07-23 04:20:29,448 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396912,396925] [2022-07-23 04:20:29,448 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397065,397078] [2022-07-23 04:20:29,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397211,397224] [2022-07-23 04:20:29,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397354,397367] [2022-07-23 04:20:29,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397506,397519] [2022-07-23 04:20:29,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397652,397665] [2022-07-23 04:20:29,452 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397797,397810] [2022-07-23 04:20:29,452 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397951,397964] [2022-07-23 04:20:29,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[398102,398115] [2022-07-23 04:20:29,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[398257,398270] [2022-07-23 04:20:29,454 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[398409,398422] [2022-07-23 04:20:29,454 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[398564,398577] [2022-07-23 04:20:29,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[398728,398741] [2022-07-23 04:20:29,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[398884,398897] [2022-07-23 04:20:29,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[399048,399061] [2022-07-23 04:20:29,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[399190,399203] [2022-07-23 04:20:29,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[399348,399361] [2022-07-23 04:20:29,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[399515,399528] [2022-07-23 04:20:29,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[399674,399687] [2022-07-23 04:20:29,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[399833,399846] [2022-07-23 04:20:29,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[399982,399995] [2022-07-23 04:20:29,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[400129,400142] [2022-07-23 04:20:29,459 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[400268,400281] [2022-07-23 04:20:29,459 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[400431,400444] [2022-07-23 04:20:29,459 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[400597,400610] [2022-07-23 04:20:29,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[400761,400774] [2022-07-23 04:20:29,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[400926,400939] [2022-07-23 04:20:29,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[401091,401104] [2022-07-23 04:20:29,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[401257,401270] [2022-07-23 04:20:29,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[401422,401435] [2022-07-23 04:20:29,462 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[401589,401602] [2022-07-23 04:20:29,462 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[401749,401762] [2022-07-23 04:20:29,462 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[401911,401924] [2022-07-23 04:20:29,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[402070,402083] [2022-07-23 04:20:29,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[402216,402229] [2022-07-23 04:20:29,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[402359,402372] [2022-07-23 04:20:29,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[402503,402516] [2022-07-23 04:20:29,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[402646,402659] [2022-07-23 04:20:29,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[402790,402803] [2022-07-23 04:20:29,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[402931,402944] [2022-07-23 04:20:29,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[403069,403082] [2022-07-23 04:20:29,466 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[403227,403240] [2022-07-23 04:20:29,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[403386,403399] [2022-07-23 04:20:29,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[403542,403555] [2022-07-23 04:20:29,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[403691,403704] [2022-07-23 04:20:29,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[403843,403856] [2022-07-23 04:20:29,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[403994,404007] [2022-07-23 04:20:29,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[404143,404156] [2022-07-23 04:20:29,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[404295,404308] [2022-07-23 04:20:29,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[404443,404456] [2022-07-23 04:20:29,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[404596,404609] [2022-07-23 04:20:29,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[404747,404760] [2022-07-23 04:20:29,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[404897,404910] [2022-07-23 04:20:29,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[405044,405057] [2022-07-23 04:20:29,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[405195,405208] [2022-07-23 04:20:29,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[405346,405359] [2022-07-23 04:20:29,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[405494,405507] [2022-07-23 04:20:29,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[405660,405673] [2022-07-23 04:20:29,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[405829,405842] [2022-07-23 04:20:29,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[405996,406009] [2022-07-23 04:20:29,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[406164,406177] [2022-07-23 04:20:29,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[406314,406327] [2022-07-23 04:20:29,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[406461,406474] [2022-07-23 04:20:29,474 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[406622,406635] [2022-07-23 04:20:29,474 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[406792,406805] [2022-07-23 04:20:29,474 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[406954,406967] [2022-07-23 04:20:29,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:20:29,528 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 04:20:29,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[393566,393579] [2022-07-23 04:20:29,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[393711,393724] [2022-07-23 04:20:29,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[393857,393870] [2022-07-23 04:20:29,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394022,394035] [2022-07-23 04:20:29,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394180,394193] [2022-07-23 04:20:29,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394338,394351] [2022-07-23 04:20:29,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394496,394509] [2022-07-23 04:20:29,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394656,394669] [2022-07-23 04:20:29,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394815,394828] [2022-07-23 04:20:29,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394954,394967] [2022-07-23 04:20:29,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[395096,395109] [2022-07-23 04:20:29,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[395245,395258] [2022-07-23 04:20:29,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[395384,395397] [2022-07-23 04:20:29,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[395539,395552] [2022-07-23 04:20:29,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[395699,395712] [2022-07-23 04:20:29,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[395850,395863] [2022-07-23 04:20:29,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396001,396014] [2022-07-23 04:20:29,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396153,396166] [2022-07-23 04:20:29,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396302,396315] [2022-07-23 04:20:29,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396450,396463] [2022-07-23 04:20:29,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396607,396620] [2022-07-23 04:20:29,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396756,396769] [2022-07-23 04:20:29,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396912,396925] [2022-07-23 04:20:29,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397065,397078] [2022-07-23 04:20:29,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397211,397224] [2022-07-23 04:20:29,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397354,397367] [2022-07-23 04:20:29,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397506,397519] [2022-07-23 04:20:29,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397652,397665] [2022-07-23 04:20:29,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397797,397810] [2022-07-23 04:20:29,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397951,397964] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[398102,398115] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[398257,398270] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[398409,398422] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[398564,398577] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[398728,398741] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[398884,398897] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[399048,399061] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[399190,399203] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[399348,399361] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[399515,399528] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[399674,399687] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[399833,399846] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[399982,399995] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[400129,400142] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[400268,400281] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[400431,400444] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[400597,400610] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[400761,400774] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[400926,400939] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[401091,401104] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[401257,401270] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[401422,401435] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[401589,401602] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[401749,401762] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[401911,401924] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[402070,402083] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[402216,402229] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[402359,402372] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[402503,402516] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[402646,402659] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[402790,402803] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[402931,402944] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[403069,403082] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[403227,403240] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[403386,403399] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[403542,403555] [2022-07-23 04:20:29,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[403691,403704] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[403843,403856] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[403994,404007] [2022-07-23 04:20:29,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[404143,404156] [2022-07-23 04:20:29,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[404295,404308] [2022-07-23 04:20:29,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[404443,404456] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[404596,404609] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[404747,404760] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[404897,404910] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[405044,405057] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[405195,405208] [2022-07-23 04:20:29,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--ethernet--icplus--ipg.ko.cil.i[405346,405359] [2022-07-23 04:20:29,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[405494,405507] [2022-07-23 04:20:29,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[405660,405673] [2022-07-23 04:20:29,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[405829,405842] [2022-07-23 04:20:29,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[405996,406009] [2022-07-23 04:20:29,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[406164,406177] [2022-07-23 04:20:29,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[406314,406327] [2022-07-23 04:20:29,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[406461,406474] [2022-07-23 04:20:29,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[406622,406635] [2022-07-23 04:20:29,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[406792,406805] [2022-07-23 04:20:29,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[406954,406967] [2022-07-23 04:20:29,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:20:30,020 INFO L208 MainTranslator]: Completed translation [2022-07-23 04:20:30,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:20:30 WrapperNode [2022-07-23 04:20:30,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 04:20:30,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 04:20:30,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 04:20:30,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 04:20:30,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:20:30" (1/1) ... [2022-07-23 04:20:30,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:20:30" (1/1) ... [2022-07-23 04:20:30,241 INFO L137 Inliner]: procedures = 655, calls = 1960, calls flagged for inlining = 296, calls inlined = 213, statements flattened = 4413 [2022-07-23 04:20:30,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 04:20:30,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 04:20:30,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 04:20:30,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 04:20:30,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:20:30" (1/1) ... [2022-07-23 04:20:30,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:20:30" (1/1) ... [2022-07-23 04:20:30,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:20:30" (1/1) ... [2022-07-23 04:20:30,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:20:30" (1/1) ... [2022-07-23 04:20:30,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:20:30" (1/1) ... [2022-07-23 04:20:30,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:20:30" (1/1) ... [2022-07-23 04:20:30,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:20:30" (1/1) ... [2022-07-23 04:20:30,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 04:20:30,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 04:20:30,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 04:20:30,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 04:20:30,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:20:30" (1/1) ... [2022-07-23 04:20:30,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:20:30,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:20:30,437 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-23 04:20:30,480 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-23 04:20:30,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:20:30,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:20:30,492 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_write [2022-07-23 04:20:30,492 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_write [2022-07-23 04:20:30,492 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2022-07-23 04:20:30,492 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2022-07-23 04:20:30,492 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-23 04:20:30,492 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-23 04:20:30,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 04:20:30,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 04:20:30,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mii_mutex_of_ipg_nic_private [2022-07-23 04:20:30,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mii_mutex_of_ipg_nic_private [2022-07-23 04:20:30,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:20:30,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:20:30,493 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-23 04:20:30,493 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-23 04:20:30,493 INFO L130 BoogieDeclarations]: Found specification of procedure init_tfdlist [2022-07-23 04:20:30,494 INFO L138 BoogieDeclarations]: Found implementation of procedure init_tfdlist [2022-07-23 04:20:30,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 04:20:30,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 04:20:30,494 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-07-23 04:20:30,494 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-07-23 04:20:30,494 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite16 [2022-07-23 04:20:30,494 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite16 [2022-07-23 04:20:30,494 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_set_multicast_list [2022-07-23 04:20:30,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_set_multicast_list [2022-07-23 04:20:30,495 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite8 [2022-07-23 04:20:30,495 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite8 [2022-07-23 04:20:30,495 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:20:30,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:20:30,495 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:20:30,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:20:30,495 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32 [2022-07-23 04:20:30,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32 [2022-07-23 04:20:30,496 INFO L130 BoogieDeclarations]: Found specification of procedure pci_name [2022-07-23 04:20:30,496 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_name [2022-07-23 04:20:30,496 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_rx_clear [2022-07-23 04:20:30,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_rx_clear [2022-07-23 04:20:30,496 INFO L130 BoogieDeclarations]: Found specification of procedure skb_checksum_none_assert [2022-07-23 04:20:30,496 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_checksum_none_assert [2022-07-23 04:20:30,496 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-23 04:20:30,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-23 04:20:30,496 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32 [2022-07-23 04:20:30,497 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32 [2022-07-23 04:20:30,497 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2022-07-23 04:20:30,497 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2022-07-23 04:20:30,497 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-07-23 04:20:30,497 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-07-23 04:20:30,497 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 04:20:30,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 04:20:30,498 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:20:30,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:20:30,498 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_single [2022-07-23 04:20:30,498 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_single [2022-07-23 04:20:30,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 04:20:30,499 INFO L130 BoogieDeclarations]: Found specification of procedure read_phy_bit [2022-07-23 04:20:30,499 INFO L138 BoogieDeclarations]: Found implementation of procedure read_phy_bit [2022-07-23 04:20:30,499 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:20:30,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:20:30,499 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_remove [2022-07-23 04:20:30,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_remove [2022-07-23 04:20:30,499 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-23 04:20:30,500 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-23 04:20:30,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-23 04:20:30,500 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-23 04:20:30,500 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-23 04:20:30,500 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_open [2022-07-23 04:20:30,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_open [2022-07-23 04:20:30,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-23 04:20:30,500 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-23 04:20:30,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-23 04:20:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-23 04:20:30,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-23 04:20:30,504 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:20:30,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:20:30,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 04:20:30,504 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:20:30,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:20:30,504 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-23 04:20:30,504 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-23 04:20:30,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-23 04:20:30,505 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-23 04:20:30,505 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:20:30,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:20:30,506 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-07-23 04:20:30,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-07-23 04:20:30,506 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-23 04:20:30,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-23 04:20:30,506 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-23 04:20:30,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-23 04:20:30,506 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_dma_mask [2022-07-23 04:20:30,506 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_set_dma_mask [2022-07-23 04:20:30,507 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-07-23 04:20:30,507 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-07-23 04:20:30,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:20:30,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:20:30,507 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-23 04:20:30,507 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-23 04:20:30,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:20:30,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:20:30,508 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_get_stats [2022-07-23 04:20:30,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_get_stats [2022-07-23 04:20:30,508 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_rxrestore [2022-07-23 04:20:30,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_rxrestore [2022-07-23 04:20:30,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 04:20:30,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_ipg_nic_private [2022-07-23 04:20:30,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_ipg_nic_private [2022-07-23 04:20:30,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 04:20:30,509 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-23 04:20:30,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-23 04:20:30,509 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-23 04:20:30,509 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-23 04:20:30,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 04:20:30,509 INFO L130 BoogieDeclarations]: Found specification of procedure ioread16 [2022-07-23 04:20:30,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread16 [2022-07-23 04:20:30,509 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 04:20:30,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 04:20:30,510 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_ioaddr [2022-07-23 04:20:30,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_ioaddr [2022-07-23 04:20:30,510 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-23 04:20:30,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-23 04:20:30,510 INFO L130 BoogieDeclarations]: Found specification of procedure ioread8 [2022-07-23 04:20:30,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread8 [2022-07-23 04:20:30,511 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-23 04:20:30,511 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-23 04:20:30,511 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-23 04:20:30,511 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-23 04:20:30,511 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:20:30,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:20:30,511 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-23 04:20:30,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-23 04:20:30,512 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_get_rxbuff [2022-07-23 04:20:30,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_get_rxbuff [2022-07-23 04:20:30,512 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_write_phy_ctl [2022-07-23 04:20:30,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_write_phy_ctl [2022-07-23 04:20:30,512 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2022-07-23 04:20:30,512 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2022-07-23 04:20:30,512 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-23 04:20:30,512 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-23 04:20:30,512 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_drive_phy_ctl_low_high [2022-07-23 04:20:30,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_drive_phy_ctl_low_high [2022-07-23 04:20:30,513 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_read [2022-07-23 04:20:30,513 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_read [2022-07-23 04:20:30,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 04:20:30,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 04:20:30,513 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_txfree [2022-07-23 04:20:30,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_txfree [2022-07-23 04:20:30,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-23 04:20:30,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-23 04:20:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 04:20:30,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 04:20:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_tx_timeout [2022-07-23 04:20:30,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_tx_timeout [2022-07-23 04:20:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 04:20:30,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 04:20:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-07-23 04:20:30,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-07-23 04:20:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure pci_map_single [2022-07-23 04:20:30,515 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_map_single [2022-07-23 04:20:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-23 04:20:30,515 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-23 04:20:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:20:30,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:20:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_tx_clear [2022-07-23 04:20:30,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_tx_clear [2022-07-23 04:20:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:20:30,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:20:30,516 INFO L130 BoogieDeclarations]: Found specification of procedure read_eeprom [2022-07-23 04:20:30,516 INFO L138 BoogieDeclarations]: Found implementation of procedure read_eeprom [2022-07-23 04:20:30,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 04:20:30,516 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:20:30,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:20:30,516 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-23 04:20:30,516 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-23 04:20:30,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 04:20:30,516 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_rx_free_skb [2022-07-23 04:20:30,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_rx_free_skb [2022-07-23 04:20:30,517 INFO L130 BoogieDeclarations]: Found specification of procedure send_three_state [2022-07-23 04:20:30,517 INFO L138 BoogieDeclarations]: Found implementation of procedure send_three_state [2022-07-23 04:20:30,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 04:20:30,517 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-23 04:20:30,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-23 04:20:30,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:20:30,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:20:30,517 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-23 04:20:30,518 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-23 04:20:30,518 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-23 04:20:30,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-23 04:20:30,518 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-23 04:20:30,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-23 04:20:30,518 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-07-23 04:20:30,518 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-07-23 04:20:30,518 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_io_config [2022-07-23 04:20:30,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_io_config [2022-07-23 04:20:30,519 INFO L130 BoogieDeclarations]: Found specification of procedure init_rfdlist [2022-07-23 04:20:30,519 INFO L138 BoogieDeclarations]: Found implementation of procedure init_rfdlist [2022-07-23 04:20:30,519 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:20:30,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:20:30,519 INFO L130 BoogieDeclarations]: Found specification of procedure dma_free_attrs [2022-07-23 04:20:30,520 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_free_attrs [2022-07-23 04:20:30,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-23 04:20:30,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-23 04:20:30,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:20:30,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:20:30,521 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-23 04:20:30,522 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-23 04:20:30,522 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-23 04:20:30,522 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-23 04:20:30,522 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:20:30,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:20:30,522 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-23 04:20:30,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-23 04:20:30,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 04:20:30,522 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:20:30,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:20:30,523 INFO L130 BoogieDeclarations]: Found specification of procedure eth_type_trans [2022-07-23 04:20:30,523 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_type_trans [2022-07-23 04:20:30,523 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 04:20:30,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 04:20:30,523 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nway_reset [2022-07-23 04:20:30,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nway_reset [2022-07-23 04:20:30,523 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:20:30,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:20:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_stop [2022-07-23 04:20:30,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_stop [2022-07-23 04:20:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_config_autoneg [2022-07-23 04:20:30,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_config_autoneg [2022-07-23 04:20:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-23 04:20:30,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-23 04:20:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_reset [2022-07-23 04:20:30,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_reset [2022-07-23 04:20:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_ipg_nic_private [2022-07-23 04:20:30,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_ipg_nic_private [2022-07-23 04:20:30,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mii_mutex_of_ipg_nic_private [2022-07-23 04:20:30,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mii_mutex_of_ipg_nic_private [2022-07-23 04:20:30,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:20:30,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:20:30,527 INFO L130 BoogieDeclarations]: Found specification of procedure pci_iounmap [2022-07-23 04:20:30,527 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_iounmap [2022-07-23 04:20:30,527 INFO L130 BoogieDeclarations]: Found specification of procedure dma_alloc_attrs [2022-07-23 04:20:30,528 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_alloc_attrs [2022-07-23 04:20:30,528 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2022-07-23 04:20:30,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 04:20:30,528 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_rx_check_error [2022-07-23 04:20:30,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_rx_check_error [2022-07-23 04:20:31,202 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 04:20:31,205 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 04:20:32,052 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 04:20:33,654 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 04:20:33,673 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 04:20:33,699 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 04:20:33,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:20:33 BoogieIcfgContainer [2022-07-23 04:20:33,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 04:20:33,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 04:20:33,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 04:20:33,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 04:20:33,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 04:20:26" (1/3) ... [2022-07-23 04:20:33,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fb2ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:20:33, skipping insertion in model container [2022-07-23 04:20:33,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:20:30" (2/3) ... [2022-07-23 04:20:33,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fb2ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:20:33, skipping insertion in model container [2022-07-23 04:20:33,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:20:33" (3/3) ... [2022-07-23 04:20:33,715 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i [2022-07-23 04:20:33,728 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 04:20:33,728 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-07-23 04:20:33,829 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 04:20:33,834 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@484ce2c0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47d34800 [2022-07-23 04:20:33,835 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-07-23 04:20:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 1906 states, 1308 states have (on average 1.3363914373088686) internal successors, (1748), 1377 states have internal predecessors, (1748), 457 states have call successors, (457), 114 states have call predecessors, (457), 113 states have return successors, (453), 450 states have call predecessors, (453), 453 states have call successors, (453) [2022-07-23 04:20:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-23 04:20:33,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:33,855 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:20:33,856 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:20:33,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:33,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1162119722, now seen corresponding path program 1 times [2022-07-23 04:20:33,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:33,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643436175] [2022-07-23 04:20:33,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:33,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:20:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:20:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:20:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:20:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:20:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:20:34,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:34,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643436175] [2022-07-23 04:20:34,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643436175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:20:34,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:20:34,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:20:34,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384814702] [2022-07-23 04:20:34,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:20:34,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:20:34,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:34,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:20:34,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:20:34,615 INFO L87 Difference]: Start difference. First operand has 1906 states, 1308 states have (on average 1.3363914373088686) internal successors, (1748), 1377 states have internal predecessors, (1748), 457 states have call successors, (457), 114 states have call predecessors, (457), 113 states have return successors, (453), 450 states have call predecessors, (453), 453 states have call successors, (453) Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-23 04:20:38,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:38,869 INFO L93 Difference]: Finished difference Result 3773 states and 5399 transitions. [2022-07-23 04:20:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:20:38,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2022-07-23 04:20:38,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:38,890 INFO L225 Difference]: With dead ends: 3773 [2022-07-23 04:20:38,890 INFO L226 Difference]: Without dead ends: 1882 [2022-07-23 04:20:38,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:20:38,905 INFO L413 NwaCegarLoop]: 2206 mSDtfsCounter, 4220 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 2120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4360 SdHoareTripleChecker+Valid, 3440 SdHoareTripleChecker+Invalid, 4724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2120 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:38,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4360 Valid, 3440 Invalid, 4724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2120 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-23 04:20:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-07-23 04:20:39,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1882. [2022-07-23 04:20:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1291 states have (on average 1.2354763749031759) internal successors, (1595), 1356 states have internal predecessors, (1595), 451 states have call successors, (451), 113 states have call predecessors, (451), 112 states have return successors, (449), 446 states have call predecessors, (449), 449 states have call successors, (449) [2022-07-23 04:20:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2495 transitions. [2022-07-23 04:20:39,050 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2495 transitions. Word has length 64 [2022-07-23 04:20:39,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:39,052 INFO L495 AbstractCegarLoop]: Abstraction has 1882 states and 2495 transitions. [2022-07-23 04:20:39,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-23 04:20:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2495 transitions. [2022-07-23 04:20:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-23 04:20:39,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:39,060 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:20:39,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 04:20:39,061 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:20:39,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:39,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1567625636, now seen corresponding path program 1 times [2022-07-23 04:20:39,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:39,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603299571] [2022-07-23 04:20:39,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:39,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:20:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:20:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:20:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:20:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:20:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:20:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:20:39,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:39,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603299571] [2022-07-23 04:20:39,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603299571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:20:39,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:20:39,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:20:39,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518223458] [2022-07-23 04:20:39,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:20:39,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:20:39,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:39,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:20:39,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:20:39,430 INFO L87 Difference]: Start difference. First operand 1882 states and 2495 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-23 04:20:43,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:43,047 INFO L93 Difference]: Finished difference Result 1882 states and 2495 transitions. [2022-07-23 04:20:43,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:20:43,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2022-07-23 04:20:43,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:43,055 INFO L225 Difference]: With dead ends: 1882 [2022-07-23 04:20:43,056 INFO L226 Difference]: Without dead ends: 1880 [2022-07-23 04:20:43,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:20:43,060 INFO L413 NwaCegarLoop]: 2188 mSDtfsCounter, 4188 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4325 SdHoareTripleChecker+Valid, 3406 SdHoareTripleChecker+Invalid, 4702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:43,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4325 Valid, 3406 Invalid, 4702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-23 04:20:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2022-07-23 04:20:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1880. [2022-07-23 04:20:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1290 states have (on average 1.2348837209302326) internal successors, (1593), 1354 states have internal predecessors, (1593), 451 states have call successors, (451), 113 states have call predecessors, (451), 112 states have return successors, (449), 446 states have call predecessors, (449), 449 states have call successors, (449) [2022-07-23 04:20:43,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2493 transitions. [2022-07-23 04:20:43,112 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2493 transitions. Word has length 70 [2022-07-23 04:20:43,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:43,114 INFO L495 AbstractCegarLoop]: Abstraction has 1880 states and 2493 transitions. [2022-07-23 04:20:43,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-23 04:20:43,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2493 transitions. [2022-07-23 04:20:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-23 04:20:43,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:43,115 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:20:43,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 04:20:43,115 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:20:43,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:43,116 INFO L85 PathProgramCache]: Analyzing trace with hash 287456320, now seen corresponding path program 1 times [2022-07-23 04:20:43,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:43,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317312321] [2022-07-23 04:20:43,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:43,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:43,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:43,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:43,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:43,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:20:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:43,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:20:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:43,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:20:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:43,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:20:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:43,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:20:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:43,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:20:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:43,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:20:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:20:43,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:43,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317312321] [2022-07-23 04:20:43,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317312321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:20:43,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:20:43,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:20:43,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685407548] [2022-07-23 04:20:43,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:20:43,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:20:43,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:43,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:20:43,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:20:43,331 INFO L87 Difference]: Start difference. First operand 1880 states and 2493 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-23 04:20:46,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:46,963 INFO L93 Difference]: Finished difference Result 1880 states and 2493 transitions. [2022-07-23 04:20:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:20:46,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2022-07-23 04:20:46,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:46,971 INFO L225 Difference]: With dead ends: 1880 [2022-07-23 04:20:46,971 INFO L226 Difference]: Without dead ends: 1878 [2022-07-23 04:20:46,972 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-23 04:20:46,973 INFO L413 NwaCegarLoop]: 2186 mSDtfsCounter, 4182 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2588 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4318 SdHoareTripleChecker+Valid, 3404 SdHoareTripleChecker+Invalid, 4700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:46,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4318 Valid, 3404 Invalid, 4700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2588 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-23 04:20:46,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2022-07-23 04:20:47,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1878. [2022-07-23 04:20:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1289 states have (on average 1.2342901474010861) internal successors, (1591), 1352 states have internal predecessors, (1591), 451 states have call successors, (451), 113 states have call predecessors, (451), 112 states have return successors, (449), 446 states have call predecessors, (449), 449 states have call successors, (449) [2022-07-23 04:20:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2491 transitions. [2022-07-23 04:20:47,030 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2491 transitions. Word has length 76 [2022-07-23 04:20:47,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:47,030 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 2491 transitions. [2022-07-23 04:20:47,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-23 04:20:47,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2491 transitions. [2022-07-23 04:20:47,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-23 04:20:47,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:47,032 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:20:47,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 04:20:47,032 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:20:47,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:47,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1590539557, now seen corresponding path program 1 times [2022-07-23 04:20:47,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:47,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450171078] [2022-07-23 04:20:47,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:47,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:47,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:47,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:47,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:47,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:20:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:47,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:20:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:47,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:20:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:47,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:47,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:20:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:47,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:20:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:47,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:20:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:47,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:20:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:47,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:20:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:20:47,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:47,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450171078] [2022-07-23 04:20:47,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450171078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:20:47,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:20:47,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:20:47,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790373643] [2022-07-23 04:20:47,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:20:47,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:20:47,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:47,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:20:47,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:20:47,236 INFO L87 Difference]: Start difference. First operand 1878 states and 2491 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-23 04:20:50,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:50,597 INFO L93 Difference]: Finished difference Result 1878 states and 2491 transitions. [2022-07-23 04:20:50,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:20:50,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2022-07-23 04:20:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:50,606 INFO L225 Difference]: With dead ends: 1878 [2022-07-23 04:20:50,606 INFO L226 Difference]: Without dead ends: 1876 [2022-07-23 04:20:50,607 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-23 04:20:50,607 INFO L413 NwaCegarLoop]: 2184 mSDtfsCounter, 4176 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4311 SdHoareTripleChecker+Valid, 3402 SdHoareTripleChecker+Invalid, 4698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:50,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4311 Valid, 3402 Invalid, 4698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-23 04:20:50,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2022-07-23 04:20:50,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1876. [2022-07-23 04:20:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1288 states have (on average 1.233695652173913) internal successors, (1589), 1350 states have internal predecessors, (1589), 451 states have call successors, (451), 113 states have call predecessors, (451), 112 states have return successors, (449), 446 states have call predecessors, (449), 449 states have call successors, (449) [2022-07-23 04:20:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2489 transitions. [2022-07-23 04:20:50,652 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2489 transitions. Word has length 82 [2022-07-23 04:20:50,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:50,652 INFO L495 AbstractCegarLoop]: Abstraction has 1876 states and 2489 transitions. [2022-07-23 04:20:50,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-23 04:20:50,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2489 transitions. [2022-07-23 04:20:50,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-23 04:20:50,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:50,654 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:20:50,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 04:20:50,654 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:20:50,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:50,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1066774035, now seen corresponding path program 1 times [2022-07-23 04:20:50,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:50,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326174111] [2022-07-23 04:20:50,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:50,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:50,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:50,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:50,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:50,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:20:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:50,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:20:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:50,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:20:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:50,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:50,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:20:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:50,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:20:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:50,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:20:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:50,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:20:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:50,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:20:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:50,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:20:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:20:50,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:50,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326174111] [2022-07-23 04:20:50,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326174111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:20:50,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:20:50,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:20:50,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637701995] [2022-07-23 04:20:50,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:20:50,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:20:50,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:50,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:20:50,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:20:50,859 INFO L87 Difference]: Start difference. First operand 1876 states and 2489 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:20:54,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:54,257 INFO L93 Difference]: Finished difference Result 1876 states and 2489 transitions. [2022-07-23 04:20:54,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:20:54,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2022-07-23 04:20:54,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:54,266 INFO L225 Difference]: With dead ends: 1876 [2022-07-23 04:20:54,267 INFO L226 Difference]: Without dead ends: 1874 [2022-07-23 04:20:54,267 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-23 04:20:54,268 INFO L413 NwaCegarLoop]: 2182 mSDtfsCounter, 4170 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2584 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4304 SdHoareTripleChecker+Valid, 3400 SdHoareTripleChecker+Invalid, 4696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:54,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4304 Valid, 3400 Invalid, 4696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2584 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-23 04:20:54,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2022-07-23 04:20:54,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1874. [2022-07-23 04:20:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1287 states have (on average 1.2331002331002332) internal successors, (1587), 1348 states have internal predecessors, (1587), 451 states have call successors, (451), 113 states have call predecessors, (451), 112 states have return successors, (449), 446 states have call predecessors, (449), 449 states have call successors, (449) [2022-07-23 04:20:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2487 transitions. [2022-07-23 04:20:54,390 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2487 transitions. Word has length 88 [2022-07-23 04:20:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:54,391 INFO L495 AbstractCegarLoop]: Abstraction has 1874 states and 2487 transitions. [2022-07-23 04:20:54,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:20:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2487 transitions. [2022-07-23 04:20:54,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-23 04:20:54,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:54,396 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:20:54,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 04:20:54,396 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:20:54,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:54,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1702010873, now seen corresponding path program 1 times [2022-07-23 04:20:54,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:54,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198207497] [2022-07-23 04:20:54,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:54,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:20:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:20:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:20:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:20:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:20:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:20:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 04:20:54,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:54,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198207497] [2022-07-23 04:20:54,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198207497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:20:54,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:20:54,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:20:54,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755687054] [2022-07-23 04:20:54,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:20:54,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:20:54,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:54,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:20:54,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:20:54,635 INFO L87 Difference]: Start difference. First operand 1874 states and 2487 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-23 04:20:59,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:59,899 INFO L93 Difference]: Finished difference Result 5136 states and 6865 transitions. [2022-07-23 04:20:59,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:20:59,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2022-07-23 04:20:59,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:59,913 INFO L225 Difference]: With dead ends: 5136 [2022-07-23 04:20:59,913 INFO L226 Difference]: Without dead ends: 3283 [2022-07-23 04:20:59,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:20:59,919 INFO L413 NwaCegarLoop]: 2885 mSDtfsCounter, 6445 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 3914 mSolverCounterSat, 4039 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6593 SdHoareTripleChecker+Valid, 4483 SdHoareTripleChecker+Invalid, 7953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4039 IncrementalHoareTripleChecker+Valid, 3914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:59,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6593 Valid, 4483 Invalid, 7953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4039 Valid, 3914 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-23 04:20:59,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2022-07-23 04:21:00,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 3122. [2022-07-23 04:21:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 2165 states have (on average 1.2397228637413396) internal successors, (2684), 2253 states have internal predecessors, (2684), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:21:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 4170 transitions. [2022-07-23 04:21:00,032 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 4170 transitions. Word has length 111 [2022-07-23 04:21:00,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:00,033 INFO L495 AbstractCegarLoop]: Abstraction has 3122 states and 4170 transitions. [2022-07-23 04:21:00,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-23 04:21:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 4170 transitions. [2022-07-23 04:21:00,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-23 04:21:00,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:00,034 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:21:00,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 04:21:00,035 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:21:00,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:00,035 INFO L85 PathProgramCache]: Analyzing trace with hash -249621299, now seen corresponding path program 1 times [2022-07-23 04:21:00,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:00,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476271078] [2022-07-23 04:21:00,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:00,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:00,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:00,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:00,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:00,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:00,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:00,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:00,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:00,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:00,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:00,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:00,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:21:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:00,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:21:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:00,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:21:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:00,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:21:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:21:00,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:00,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476271078] [2022-07-23 04:21:00,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476271078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:00,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:00,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:00,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027063731] [2022-07-23 04:21:00,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:00,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:00,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:00,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:00,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:00,252 INFO L87 Difference]: Start difference. First operand 3122 states and 4170 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:21:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:03,292 INFO L93 Difference]: Finished difference Result 3122 states and 4170 transitions. [2022-07-23 04:21:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:21:03,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2022-07-23 04:21:03,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:03,328 INFO L225 Difference]: With dead ends: 3122 [2022-07-23 04:21:03,329 INFO L226 Difference]: Without dead ends: 3120 [2022-07-23 04:21:03,330 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-23 04:21:03,331 INFO L413 NwaCegarLoop]: 2180 mSDtfsCounter, 4164 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4297 SdHoareTripleChecker+Valid, 3398 SdHoareTripleChecker+Invalid, 4694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:03,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4297 Valid, 3398 Invalid, 4694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2582 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-23 04:21:03,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2022-07-23 04:21:03,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 3120. [2022-07-23 04:21:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3120 states, 2164 states have (on average 1.2393715341959335) internal successors, (2682), 2251 states have internal predecessors, (2682), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:21:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 4168 transitions. [2022-07-23 04:21:03,443 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 4168 transitions. Word has length 94 [2022-07-23 04:21:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:03,443 INFO L495 AbstractCegarLoop]: Abstraction has 3120 states and 4168 transitions. [2022-07-23 04:21:03,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:21:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 4168 transitions. [2022-07-23 04:21:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-23 04:21:03,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:03,446 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:21:03,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 04:21:03,447 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:21:03,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:03,447 INFO L85 PathProgramCache]: Analyzing trace with hash 333765064, now seen corresponding path program 1 times [2022-07-23 04:21:03,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:03,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091137774] [2022-07-23 04:21:03,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:03,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:21:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:21:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:21:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:21:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:21:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:21:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-23 04:21:03,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:03,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091137774] [2022-07-23 04:21:03,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091137774] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:21:03,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326790875] [2022-07-23 04:21:03,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:03,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:21:03,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:21:03,646 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-23 04:21:03,649 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-23 04:21:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 1917 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 04:21:04,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:21:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 04:21:04,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:21:04,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326790875] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:04,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:21:04,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-23 04:21:04,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237687218] [2022-07-23 04:21:04,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:04,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 04:21:04,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:04,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 04:21:04,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:21:04,337 INFO L87 Difference]: Start difference. First operand 3120 states and 4168 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:21:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:04,460 INFO L93 Difference]: Finished difference Result 6215 states and 8301 transitions. [2022-07-23 04:21:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 04:21:04,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2022-07-23 04:21:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:04,474 INFO L225 Difference]: With dead ends: 6215 [2022-07-23 04:21:04,475 INFO L226 Difference]: Without dead ends: 3116 [2022-07-23 04:21:04,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:21:04,486 INFO L413 NwaCegarLoop]: 2479 mSDtfsCounter, 2462 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2462 SdHoareTripleChecker+Valid, 2479 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:04,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2462 Valid, 2479 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 04:21:04,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2022-07-23 04:21:04,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 3116. [2022-07-23 04:21:04,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3116 states, 2161 states have (on average 1.2387783433595558) internal successors, (2677), 2247 states have internal predecessors, (2677), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:21:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 4163 transitions. [2022-07-23 04:21:04,608 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 4163 transitions. Word has length 117 [2022-07-23 04:21:04,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:04,609 INFO L495 AbstractCegarLoop]: Abstraction has 3116 states and 4163 transitions. [2022-07-23 04:21:04,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:21:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 4163 transitions. [2022-07-23 04:21:04,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-23 04:21:04,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:04,611 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:21:04,650 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-23 04:21:04,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:21:04,834 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:21:04,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:04,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1509829772, now seen corresponding path program 1 times [2022-07-23 04:21:04,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:04,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999900161] [2022-07-23 04:21:04,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:04,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:21:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:21:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:21:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:21:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:21:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,060 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:21:05,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:05,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999900161] [2022-07-23 04:21:05,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999900161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:05,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:05,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:05,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837439074] [2022-07-23 04:21:05,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:05,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:05,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:05,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:05,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:05,062 INFO L87 Difference]: Start difference. First operand 3116 states and 4163 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 04:21:08,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:08,317 INFO L93 Difference]: Finished difference Result 3116 states and 4163 transitions. [2022-07-23 04:21:08,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:21:08,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2022-07-23 04:21:08,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:08,335 INFO L225 Difference]: With dead ends: 3116 [2022-07-23 04:21:08,335 INFO L226 Difference]: Without dead ends: 3114 [2022-07-23 04:21:08,337 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-23 04:21:08,338 INFO L413 NwaCegarLoop]: 2173 mSDtfsCounter, 4153 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2579 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4285 SdHoareTripleChecker+Valid, 3377 SdHoareTripleChecker+Invalid, 4691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:08,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4285 Valid, 3377 Invalid, 4691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2579 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-23 04:21:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2022-07-23 04:21:08,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3114. [2022-07-23 04:21:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3114 states, 2160 states have (on average 1.2384259259259258) internal successors, (2675), 2245 states have internal predecessors, (2675), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:21:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 4161 transitions. [2022-07-23 04:21:08,443 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 4161 transitions. Word has length 100 [2022-07-23 04:21:08,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:08,443 INFO L495 AbstractCegarLoop]: Abstraction has 3114 states and 4161 transitions. [2022-07-23 04:21:08,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 04:21:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 4161 transitions. [2022-07-23 04:21:08,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-23 04:21:08,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:08,446 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:21:08,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 04:21:08,446 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:21:08,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:08,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1795905648, now seen corresponding path program 1 times [2022-07-23 04:21:08,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:08,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311450036] [2022-07-23 04:21:08,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:08,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:08,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:08,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:08,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:08,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:08,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:08,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:08,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:08,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:08,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:08,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:08,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:21:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:08,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:21:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:08,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:21:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:08,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:21:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:08,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:21:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:08,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:08,617 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:21:08,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:08,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311450036] [2022-07-23 04:21:08,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311450036] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:08,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:08,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:08,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143667687] [2022-07-23 04:21:08,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:08,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:08,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:08,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:08,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:08,619 INFO L87 Difference]: Start difference. First operand 3114 states and 4161 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:21:12,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:12,030 INFO L93 Difference]: Finished difference Result 3114 states and 4161 transitions. [2022-07-23 04:21:12,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:21:12,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2022-07-23 04:21:12,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:12,048 INFO L225 Difference]: With dead ends: 3114 [2022-07-23 04:21:12,048 INFO L226 Difference]: Without dead ends: 3112 [2022-07-23 04:21:12,052 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-23 04:21:12,052 INFO L413 NwaCegarLoop]: 2171 mSDtfsCounter, 4151 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2573 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4282 SdHoareTripleChecker+Valid, 3375 SdHoareTripleChecker+Invalid, 4685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:12,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4282 Valid, 3375 Invalid, 4685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2573 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-23 04:21:12,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2022-07-23 04:21:12,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 3112. [2022-07-23 04:21:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3112 states, 2159 states have (on average 1.238073182028717) internal successors, (2673), 2243 states have internal predecessors, (2673), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:21:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4159 transitions. [2022-07-23 04:21:12,196 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4159 transitions. Word has length 106 [2022-07-23 04:21:12,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:12,197 INFO L495 AbstractCegarLoop]: Abstraction has 3112 states and 4159 transitions. [2022-07-23 04:21:12,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:21:12,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4159 transitions. [2022-07-23 04:21:12,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-23 04:21:12,198 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:12,198 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:21:12,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 04:21:12,199 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:21:12,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:12,199 INFO L85 PathProgramCache]: Analyzing trace with hash -711355629, now seen corresponding path program 1 times [2022-07-23 04:21:12,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:12,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670700955] [2022-07-23 04:21:12,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:12,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:21:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:21:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:21:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:21:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:21:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:21:12,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:12,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670700955] [2022-07-23 04:21:12,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670700955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:12,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:12,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:12,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957175599] [2022-07-23 04:21:12,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:12,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:12,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:12,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:12,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:12,365 INFO L87 Difference]: Start difference. First operand 3112 states and 4159 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:21:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:16,093 INFO L93 Difference]: Finished difference Result 3112 states and 4159 transitions. [2022-07-23 04:21:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:21:16,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2022-07-23 04:21:16,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:16,110 INFO L225 Difference]: With dead ends: 3112 [2022-07-23 04:21:16,110 INFO L226 Difference]: Without dead ends: 3110 [2022-07-23 04:21:16,112 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-23 04:21:16,113 INFO L413 NwaCegarLoop]: 2169 mSDtfsCounter, 4139 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4270 SdHoareTripleChecker+Valid, 3373 SdHoareTripleChecker+Invalid, 4687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:16,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4270 Valid, 3373 Invalid, 4687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-23 04:21:16,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2022-07-23 04:21:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 3110. [2022-07-23 04:21:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3110 states, 2158 states have (on average 1.2377201112140872) internal successors, (2671), 2241 states have internal predecessors, (2671), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:21:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 4157 transitions. [2022-07-23 04:21:16,232 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 4157 transitions. Word has length 108 [2022-07-23 04:21:16,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:16,234 INFO L495 AbstractCegarLoop]: Abstraction has 3110 states and 4157 transitions. [2022-07-23 04:21:16,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:21:16,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 4157 transitions. [2022-07-23 04:21:16,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-23 04:21:16,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:16,236 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:21:16,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 04:21:16,237 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:21:16,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:16,237 INFO L85 PathProgramCache]: Analyzing trace with hash -372751528, now seen corresponding path program 1 times [2022-07-23 04:21:16,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:16,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851323362] [2022-07-23 04:21:16,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:16,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:21:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:21:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:21:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:21:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:21:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:21:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:21:16,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:16,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851323362] [2022-07-23 04:21:16,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851323362] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:16,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:16,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:16,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046024566] [2022-07-23 04:21:16,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:16,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:16,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:16,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:16,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:16,451 INFO L87 Difference]: Start difference. First operand 3110 states and 4157 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-23 04:21:19,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:19,359 INFO L93 Difference]: Finished difference Result 3110 states and 4157 transitions. [2022-07-23 04:21:19,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:21:19,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 114 [2022-07-23 04:21:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:19,387 INFO L225 Difference]: With dead ends: 3110 [2022-07-23 04:21:19,387 INFO L226 Difference]: Without dead ends: 3108 [2022-07-23 04:21:19,389 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-23 04:21:19,392 INFO L413 NwaCegarLoop]: 2167 mSDtfsCounter, 4135 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2573 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4265 SdHoareTripleChecker+Valid, 3371 SdHoareTripleChecker+Invalid, 4685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:19,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4265 Valid, 3371 Invalid, 4685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2573 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-23 04:21:19,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2022-07-23 04:21:19,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 3108. [2022-07-23 04:21:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3108 states, 2157 states have (on average 1.237366713027353) internal successors, (2669), 2239 states have internal predecessors, (2669), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:21:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 4155 transitions. [2022-07-23 04:21:19,632 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 4155 transitions. Word has length 114 [2022-07-23 04:21:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:19,647 INFO L495 AbstractCegarLoop]: Abstraction has 3108 states and 4155 transitions. [2022-07-23 04:21:19,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-23 04:21:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 4155 transitions. [2022-07-23 04:21:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-23 04:21:19,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:19,649 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:21:19,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 04:21:19,649 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:21:19,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:19,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1629281415, now seen corresponding path program 1 times [2022-07-23 04:21:19,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:19,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235581910] [2022-07-23 04:21:19,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:19,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:21:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:21:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:21:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:21:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:21:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:21:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:21:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:21:19,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:20,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235581910] [2022-07-23 04:21:20,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235581910] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:20,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:20,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:20,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951613006] [2022-07-23 04:21:20,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:20,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:20,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:20,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:20,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:20,001 INFO L87 Difference]: Start difference. First operand 3108 states and 4155 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 04:21:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:23,428 INFO L93 Difference]: Finished difference Result 3108 states and 4155 transitions. [2022-07-23 04:21:23,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:21:23,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2022-07-23 04:21:23,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:23,447 INFO L225 Difference]: With dead ends: 3108 [2022-07-23 04:21:23,447 INFO L226 Difference]: Without dead ends: 3106 [2022-07-23 04:21:23,449 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-23 04:21:23,450 INFO L413 NwaCegarLoop]: 2165 mSDtfsCounter, 4129 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4258 SdHoareTripleChecker+Valid, 3369 SdHoareTripleChecker+Invalid, 4683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:23,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4258 Valid, 3369 Invalid, 4683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2571 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-23 04:21:23,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2022-07-23 04:21:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3106. [2022-07-23 04:21:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 2156 states have (on average 1.2370129870129871) internal successors, (2667), 2237 states have internal predecessors, (2667), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:21:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 4153 transitions. [2022-07-23 04:21:23,573 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 4153 transitions. Word has length 120 [2022-07-23 04:21:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:23,574 INFO L495 AbstractCegarLoop]: Abstraction has 3106 states and 4153 transitions. [2022-07-23 04:21:23,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 04:21:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 4153 transitions. [2022-07-23 04:21:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-23 04:21:23,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:23,575 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:21:23,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 04:21:23,576 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:21:23,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:23,576 INFO L85 PathProgramCache]: Analyzing trace with hash 408849737, now seen corresponding path program 1 times [2022-07-23 04:21:23,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:23,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301676232] [2022-07-23 04:21:23,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:23,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:21:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:21:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:21:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:21:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:21:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:21:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:21:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:21:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:21:23,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:23,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301676232] [2022-07-23 04:21:23,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301676232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:23,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:23,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:23,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31972550] [2022-07-23 04:21:23,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:23,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:23,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:23,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:23,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:23,736 INFO L87 Difference]: Start difference. First operand 3106 states and 4153 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 04:21:27,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:27,341 INFO L93 Difference]: Finished difference Result 3106 states and 4153 transitions. [2022-07-23 04:21:27,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:21:27,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2022-07-23 04:21:27,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:27,374 INFO L225 Difference]: With dead ends: 3106 [2022-07-23 04:21:27,375 INFO L226 Difference]: Without dead ends: 3104 [2022-07-23 04:21:27,376 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-23 04:21:27,376 INFO L413 NwaCegarLoop]: 2163 mSDtfsCounter, 4123 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2569 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4251 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 4681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:27,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4251 Valid, 3367 Invalid, 4681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2569 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-23 04:21:27,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3104 states. [2022-07-23 04:21:27,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3104 to 3104. [2022-07-23 04:21:27,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3104 states, 2155 states have (on average 1.2366589327146171) internal successors, (2665), 2235 states have internal predecessors, (2665), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:21:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 4151 transitions. [2022-07-23 04:21:27,514 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 4151 transitions. Word has length 126 [2022-07-23 04:21:27,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:27,515 INFO L495 AbstractCegarLoop]: Abstraction has 3104 states and 4151 transitions. [2022-07-23 04:21:27,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 04:21:27,515 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 4151 transitions. [2022-07-23 04:21:27,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-23 04:21:27,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:27,516 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:21:27,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 04:21:27,517 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:21:27,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:27,517 INFO L85 PathProgramCache]: Analyzing trace with hash -753274789, now seen corresponding path program 1 times [2022-07-23 04:21:27,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:27,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683750913] [2022-07-23 04:21:27,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:27,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:21:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:21:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:21:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:21:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:21:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:21:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:21:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:21:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:21:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:27,763 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:21:27,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:27,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683750913] [2022-07-23 04:21:27,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683750913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:27,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:27,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:27,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895827013] [2022-07-23 04:21:27,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:27,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:27,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:27,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:27,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:27,768 INFO L87 Difference]: Start difference. First operand 3104 states and 4151 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 04:21:31,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:31,438 INFO L93 Difference]: Finished difference Result 3104 states and 4151 transitions. [2022-07-23 04:21:31,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:21:31,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2022-07-23 04:21:31,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:31,451 INFO L225 Difference]: With dead ends: 3104 [2022-07-23 04:21:31,451 INFO L226 Difference]: Without dead ends: 3102 [2022-07-23 04:21:31,454 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-23 04:21:31,457 INFO L413 NwaCegarLoop]: 2161 mSDtfsCounter, 4117 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4244 SdHoareTripleChecker+Valid, 3365 SdHoareTripleChecker+Invalid, 4679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:31,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4244 Valid, 3365 Invalid, 4679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2567 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-23 04:21:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2022-07-23 04:21:31,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 3102. [2022-07-23 04:21:31,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3102 states, 2154 states have (on average 1.2363045496750231) internal successors, (2663), 2233 states have internal predecessors, (2663), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:21:31,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 4149 transitions. [2022-07-23 04:21:31,572 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 4149 transitions. Word has length 132 [2022-07-23 04:21:31,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:31,572 INFO L495 AbstractCegarLoop]: Abstraction has 3102 states and 4149 transitions. [2022-07-23 04:21:31,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 04:21:31,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 4149 transitions. [2022-07-23 04:21:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-23 04:21:31,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:31,574 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:21:31,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 04:21:31,574 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:21:31,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash -499223925, now seen corresponding path program 1 times [2022-07-23 04:21:31,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:31,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611555692] [2022-07-23 04:21:31,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:21:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:21:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:21:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:21:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:21:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:21:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:21:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:21:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:21:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:21:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:21:31,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:31,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611555692] [2022-07-23 04:21:31,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611555692] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:31,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:31,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:31,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242540757] [2022-07-23 04:21:31,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:31,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:31,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:31,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:31,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:31,806 INFO L87 Difference]: Start difference. First operand 3102 states and 4149 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-23 04:21:35,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:35,223 INFO L93 Difference]: Finished difference Result 3102 states and 4149 transitions. [2022-07-23 04:21:35,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:21:35,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2022-07-23 04:21:35,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:35,233 INFO L225 Difference]: With dead ends: 3102 [2022-07-23 04:21:35,234 INFO L226 Difference]: Without dead ends: 3100 [2022-07-23 04:21:35,235 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-23 04:21:35,236 INFO L413 NwaCegarLoop]: 2159 mSDtfsCounter, 4111 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2565 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4237 SdHoareTripleChecker+Valid, 3363 SdHoareTripleChecker+Invalid, 4677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:35,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4237 Valid, 3363 Invalid, 4677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2565 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-23 04:21:35,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2022-07-23 04:21:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3100. [2022-07-23 04:21:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 2153 states have (on average 1.2359498374361357) internal successors, (2661), 2231 states have internal predecessors, (2661), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:21:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4147 transitions. [2022-07-23 04:21:35,423 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4147 transitions. Word has length 138 [2022-07-23 04:21:35,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:35,425 INFO L495 AbstractCegarLoop]: Abstraction has 3100 states and 4147 transitions. [2022-07-23 04:21:35,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-23 04:21:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4147 transitions. [2022-07-23 04:21:35,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-23 04:21:35,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:35,429 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:21:35,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 04:21:35,429 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:21:35,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:35,429 INFO L85 PathProgramCache]: Analyzing trace with hash -867666618, now seen corresponding path program 1 times [2022-07-23 04:21:35,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:35,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411324556] [2022-07-23 04:21:35,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:35,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:21:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:21:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:21:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:21:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:21:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:21:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:21:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:21:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:21:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:21:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:21:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:21:35,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:35,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411324556] [2022-07-23 04:21:35,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411324556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:35,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:35,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:35,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334655961] [2022-07-23 04:21:35,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:35,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:35,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:35,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:35,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:35,740 INFO L87 Difference]: Start difference. First operand 3100 states and 4147 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-23 04:21:38,305 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:21:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:40,994 INFO L93 Difference]: Finished difference Result 3100 states and 4147 transitions. [2022-07-23 04:21:40,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:21:40,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2022-07-23 04:21:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:41,022 INFO L225 Difference]: With dead ends: 3100 [2022-07-23 04:21:41,022 INFO L226 Difference]: Without dead ends: 3098 [2022-07-23 04:21:41,024 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-23 04:21:41,025 INFO L413 NwaCegarLoop]: 2157 mSDtfsCounter, 4105 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2563 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4230 SdHoareTripleChecker+Valid, 3361 SdHoareTripleChecker+Invalid, 4675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:41,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4230 Valid, 3361 Invalid, 4675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2563 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-23 04:21:41,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2022-07-23 04:21:41,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 3098. [2022-07-23 04:21:41,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 2152 states have (on average 1.2355947955390334) internal successors, (2659), 2229 states have internal predecessors, (2659), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:21:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4145 transitions. [2022-07-23 04:21:41,153 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4145 transitions. Word has length 144 [2022-07-23 04:21:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:41,154 INFO L495 AbstractCegarLoop]: Abstraction has 3098 states and 4145 transitions. [2022-07-23 04:21:41,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-23 04:21:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4145 transitions. [2022-07-23 04:21:41,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-23 04:21:41,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:41,156 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:21:41,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 04:21:41,156 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:21:41,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash -312577598, now seen corresponding path program 1 times [2022-07-23 04:21:41,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:41,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391656234] [2022-07-23 04:21:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:41,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:21:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:21:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:21:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:21:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:21:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:21:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:21:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:21:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:21:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:21:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:21:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:21:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:21:41,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:41,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391656234] [2022-07-23 04:21:41,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391656234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:41,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:41,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:41,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218871871] [2022-07-23 04:21:41,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:41,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:41,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:41,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:41,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:41,448 INFO L87 Difference]: Start difference. First operand 3098 states and 4145 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-23 04:21:44,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:44,469 INFO L93 Difference]: Finished difference Result 3098 states and 4145 transitions. [2022-07-23 04:21:44,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:21:44,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2022-07-23 04:21:44,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:44,478 INFO L225 Difference]: With dead ends: 3098 [2022-07-23 04:21:44,478 INFO L226 Difference]: Without dead ends: 3096 [2022-07-23 04:21:44,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:21:44,480 INFO L413 NwaCegarLoop]: 2155 mSDtfsCounter, 4099 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2561 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4223 SdHoareTripleChecker+Valid, 3359 SdHoareTripleChecker+Invalid, 4673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:44,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4223 Valid, 3359 Invalid, 4673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2561 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-23 04:21:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2022-07-23 04:21:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 3096. [2022-07-23 04:21:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3096 states, 2151 states have (on average 1.2352394235239423) internal successors, (2657), 2227 states have internal predecessors, (2657), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:21:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 4143 transitions. [2022-07-23 04:21:44,606 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 4143 transitions. Word has length 150 [2022-07-23 04:21:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:44,606 INFO L495 AbstractCegarLoop]: Abstraction has 3096 states and 4143 transitions. [2022-07-23 04:21:44,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-23 04:21:44,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 4143 transitions. [2022-07-23 04:21:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-23 04:21:44,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:44,609 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:21:44,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 04:21:44,609 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:21:44,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:44,609 INFO L85 PathProgramCache]: Analyzing trace with hash 135128004, now seen corresponding path program 1 times [2022-07-23 04:21:44,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:44,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632067493] [2022-07-23 04:21:44,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:44,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:21:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:21:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:21:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:21:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:21:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:21:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:21:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:21:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:21:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:21:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:21:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:21:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:21:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:44,793 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:21:44,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:44,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632067493] [2022-07-23 04:21:44,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632067493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:44,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:44,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:44,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685663925] [2022-07-23 04:21:44,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:44,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:44,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:44,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:44,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:44,796 INFO L87 Difference]: Start difference. First operand 3096 states and 4143 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-23 04:21:47,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:47,888 INFO L93 Difference]: Finished difference Result 3096 states and 4143 transitions. [2022-07-23 04:21:47,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:21:47,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2022-07-23 04:21:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:47,899 INFO L225 Difference]: With dead ends: 3096 [2022-07-23 04:21:47,899 INFO L226 Difference]: Without dead ends: 3094 [2022-07-23 04:21:47,900 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-23 04:21:47,901 INFO L413 NwaCegarLoop]: 2153 mSDtfsCounter, 4093 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4216 SdHoareTripleChecker+Valid, 3357 SdHoareTripleChecker+Invalid, 4671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:47,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4216 Valid, 3357 Invalid, 4671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-23 04:21:47,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2022-07-23 04:21:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3094. [2022-07-23 04:21:48,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3094 states, 2150 states have (on average 1.2348837209302326) internal successors, (2655), 2225 states have internal predecessors, (2655), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:21:48,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 4141 transitions. [2022-07-23 04:21:48,021 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 4141 transitions. Word has length 156 [2022-07-23 04:21:48,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:48,021 INFO L495 AbstractCegarLoop]: Abstraction has 3094 states and 4141 transitions. [2022-07-23 04:21:48,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-23 04:21:48,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 4141 transitions. [2022-07-23 04:21:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-23 04:21:48,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:48,024 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:21:48,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-23 04:21:48,025 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:21:48,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:48,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1099415850, now seen corresponding path program 1 times [2022-07-23 04:21:48,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:48,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877133878] [2022-07-23 04:21:48,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:48,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:21:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:21:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:21:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:21:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:21:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:21:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:21:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:21:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:21:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:21:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:21:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:21:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:21:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:21:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:21:48,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:48,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877133878] [2022-07-23 04:21:48,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877133878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:48,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:48,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:48,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680800691] [2022-07-23 04:21:48,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:48,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:48,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:48,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:48,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:48,229 INFO L87 Difference]: Start difference. First operand 3094 states and 4141 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-23 04:21:51,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:51,209 INFO L93 Difference]: Finished difference Result 3094 states and 4141 transitions. [2022-07-23 04:21:51,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:21:51,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2022-07-23 04:21:51,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:51,221 INFO L225 Difference]: With dead ends: 3094 [2022-07-23 04:21:51,221 INFO L226 Difference]: Without dead ends: 3092 [2022-07-23 04:21:51,223 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-23 04:21:51,225 INFO L413 NwaCegarLoop]: 2151 mSDtfsCounter, 4087 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2557 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4209 SdHoareTripleChecker+Valid, 3355 SdHoareTripleChecker+Invalid, 4669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:51,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4209 Valid, 3355 Invalid, 4669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2557 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-23 04:21:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2022-07-23 04:21:51,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 3092. [2022-07-23 04:21:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3092 states, 2149 states have (on average 1.234527687296417) internal successors, (2653), 2223 states have internal predecessors, (2653), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:21:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4139 transitions. [2022-07-23 04:21:51,465 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4139 transitions. Word has length 162 [2022-07-23 04:21:51,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:51,465 INFO L495 AbstractCegarLoop]: Abstraction has 3092 states and 4139 transitions. [2022-07-23 04:21:51,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-23 04:21:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4139 transitions. [2022-07-23 04:21:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-07-23 04:21:51,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:51,468 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:21:51,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 04:21:51,468 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:21:51,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:51,468 INFO L85 PathProgramCache]: Analyzing trace with hash -122245697, now seen corresponding path program 1 times [2022-07-23 04:21:51,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:51,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684316241] [2022-07-23 04:21:51,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:51,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:21:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:21:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:21:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:21:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:21:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:21:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-23 04:21:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-23 04:21:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 04:21:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 04:21:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 04:21:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-23 04:21:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-23 04:21:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-23 04:21:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2022-07-23 04:21:51,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:51,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684316241] [2022-07-23 04:21:51,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684316241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:51,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:51,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:21:51,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709103570] [2022-07-23 04:21:51,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:51,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:21:51,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:51,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:21:51,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:21:51,825 INFO L87 Difference]: Start difference. First operand 3092 states and 4139 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-23 04:21:59,888 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-23 04:22:00,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:22:00,517 INFO L93 Difference]: Finished difference Result 3241 states and 4371 transitions. [2022-07-23 04:22:00,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 04:22:00,519 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 205 [2022-07-23 04:22:00,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:22:00,536 INFO L225 Difference]: With dead ends: 3241 [2022-07-23 04:22:00,537 INFO L226 Difference]: Without dead ends: 3239 [2022-07-23 04:22:00,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-07-23 04:22:00,541 INFO L413 NwaCegarLoop]: 2143 mSDtfsCounter, 5025 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 5363 mSolverCounterSat, 2905 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5149 SdHoareTripleChecker+Valid, 4204 SdHoareTripleChecker+Invalid, 8269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2905 IncrementalHoareTripleChecker+Valid, 5363 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:22:00,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5149 Valid, 4204 Invalid, 8269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2905 Valid, 5363 Invalid, 1 Unknown, 0 Unchecked, 8.3s Time] [2022-07-23 04:22:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2022-07-23 04:22:00,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 3090. [2022-07-23 04:22:00,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3090 states, 2148 states have (on average 1.233705772811918) internal successors, (2650), 2221 states have internal predecessors, (2650), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:22:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 4136 transitions. [2022-07-23 04:22:00,890 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 4136 transitions. Word has length 205 [2022-07-23 04:22:00,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:22:00,891 INFO L495 AbstractCegarLoop]: Abstraction has 3090 states and 4136 transitions. [2022-07-23 04:22:00,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-23 04:22:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 4136 transitions. [2022-07-23 04:22:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-23 04:22:00,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:22:00,895 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:22:00,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-23 04:22:00,896 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:22:00,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:22:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1437092455, now seen corresponding path program 1 times [2022-07-23 04:22:00,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:22:00,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267985641] [2022-07-23 04:22:00,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:00,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:22:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:22:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:22:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:22:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:22:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:22:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:22:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:22:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:22:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:22:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:22:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:22:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:22:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:22:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:22:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:22:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:22:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:22:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:22:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:22:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:22:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:22:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:22:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:22:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:22:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:22:01,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:22:01,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267985641] [2022-07-23 04:22:01,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267985641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:22:01,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:22:01,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:22:01,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132873967] [2022-07-23 04:22:01,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:22:01,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:22:01,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:22:01,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:22:01,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:22:01,194 INFO L87 Difference]: Start difference. First operand 3090 states and 4136 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-23 04:22:04,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:22:04,919 INFO L93 Difference]: Finished difference Result 3090 states and 4136 transitions. [2022-07-23 04:22:04,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:22:04,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2022-07-23 04:22:04,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:22:04,931 INFO L225 Difference]: With dead ends: 3090 [2022-07-23 04:22:04,931 INFO L226 Difference]: Without dead ends: 3088 [2022-07-23 04:22:04,933 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-23 04:22:04,934 INFO L413 NwaCegarLoop]: 2147 mSDtfsCounter, 4075 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2553 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4196 SdHoareTripleChecker+Valid, 3351 SdHoareTripleChecker+Invalid, 4665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:22:04,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4196 Valid, 3351 Invalid, 4665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2553 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-23 04:22:04,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2022-07-23 04:22:05,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 3088. [2022-07-23 04:22:05,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3088 states, 2147 states have (on average 1.2333488588728458) internal successors, (2648), 2219 states have internal predecessors, (2648), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:22:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 4134 transitions. [2022-07-23 04:22:05,075 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 4134 transitions. Word has length 168 [2022-07-23 04:22:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:22:05,076 INFO L495 AbstractCegarLoop]: Abstraction has 3088 states and 4134 transitions. [2022-07-23 04:22:05,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-23 04:22:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 4134 transitions. [2022-07-23 04:22:05,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-23 04:22:05,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:22:05,078 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:22:05,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-23 04:22:05,078 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:22:05,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:22:05,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1470050927, now seen corresponding path program 1 times [2022-07-23 04:22:05,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:22:05,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124345159] [2022-07-23 04:22:05,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:05,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:22:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:22:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:22:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:22:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:22:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:22:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:22:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:22:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:22:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:22:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:22:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:22:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:22:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:22:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:22:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:22:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:22:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:22:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:22:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:22:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:22:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:22:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:22:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:22:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:22:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 04:22:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:22:05,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:22:05,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124345159] [2022-07-23 04:22:05,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124345159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:22:05,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:22:05,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:22:05,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748818473] [2022-07-23 04:22:05,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:22:05,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:22:05,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:22:05,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:22:05,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:22:05,298 INFO L87 Difference]: Start difference. First operand 3088 states and 4134 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-23 04:22:08,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:22:08,814 INFO L93 Difference]: Finished difference Result 3088 states and 4134 transitions. [2022-07-23 04:22:08,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:22:08,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2022-07-23 04:22:08,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:22:08,822 INFO L225 Difference]: With dead ends: 3088 [2022-07-23 04:22:08,823 INFO L226 Difference]: Without dead ends: 3086 [2022-07-23 04:22:08,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:22:08,827 INFO L413 NwaCegarLoop]: 2145 mSDtfsCounter, 4069 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4189 SdHoareTripleChecker+Valid, 3349 SdHoareTripleChecker+Invalid, 4663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:22:08,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4189 Valid, 3349 Invalid, 4663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-23 04:22:08,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3086 states. [2022-07-23 04:22:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3086 to 3086. [2022-07-23 04:22:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 2146 states have (on average 1.232991612301957) internal successors, (2646), 2217 states have internal predecessors, (2646), 744 states have call successors, (744), 190 states have call predecessors, (744), 189 states have return successors, (742), 737 states have call predecessors, (742), 742 states have call successors, (742) [2022-07-23 04:22:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 4132 transitions. [2022-07-23 04:22:08,967 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 4132 transitions. Word has length 174 [2022-07-23 04:22:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:22:08,968 INFO L495 AbstractCegarLoop]: Abstraction has 3086 states and 4132 transitions. [2022-07-23 04:22:08,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-23 04:22:08,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 4132 transitions. [2022-07-23 04:22:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-23 04:22:08,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:22:08,970 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:22:08,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-23 04:22:08,971 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:22:08,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:22:08,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1645425594, now seen corresponding path program 1 times [2022-07-23 04:22:08,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:22:08,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518673805] [2022-07-23 04:22:08,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:08,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:22:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:22:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:22:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:22:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:22:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:22:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:22:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:22:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:22:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:22:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-23 04:22:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-23 04:22:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 04:22:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 04:22:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 04:22:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-23 04:22:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-23 04:22:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:22:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-23 04:22:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:22:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-07-23 04:22:09,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:22:09,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518673805] [2022-07-23 04:22:09,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518673805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:22:09,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:22:09,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 04:22:09,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783973357] [2022-07-23 04:22:09,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:22:09,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:22:09,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:22:09,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:22:09,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:22:09,265 INFO L87 Difference]: Start difference. First operand 3086 states and 4132 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (32), 7 states have call predecessors, (32), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-23 04:22:20,358 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-23 04:22:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:22:22,040 INFO L93 Difference]: Finished difference Result 4612 states and 6232 transitions. [2022-07-23 04:22:22,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 04:22:22,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (32), 7 states have call predecessors, (32), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 211 [2022-07-23 04:22:22,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:22:22,054 INFO L225 Difference]: With dead ends: 4612 [2022-07-23 04:22:22,054 INFO L226 Difference]: Without dead ends: 4610 [2022-07-23 04:22:22,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2022-07-23 04:22:22,058 INFO L413 NwaCegarLoop]: 2305 mSDtfsCounter, 7514 mSDsluCounter, 2415 mSDsCounter, 0 mSdLazyCounter, 7810 mSolverCounterSat, 4744 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7639 SdHoareTripleChecker+Valid, 4720 SdHoareTripleChecker+Invalid, 12555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4744 IncrementalHoareTripleChecker+Valid, 7810 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:22:22,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7639 Valid, 4720 Invalid, 12555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4744 Valid, 7810 Invalid, 1 Unknown, 0 Unchecked, 12.1s Time] [2022-07-23 04:22:22,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2022-07-23 04:22:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 3955. [2022-07-23 04:22:22,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3955 states, 2749 states have (on average 1.2269916333212076) internal successors, (3373), 2825 states have internal predecessors, (3373), 938 states have call successors, (938), 263 states have call predecessors, (938), 262 states have return successors, (936), 931 states have call predecessors, (936), 936 states have call successors, (936) [2022-07-23 04:22:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3955 states to 3955 states and 5247 transitions. [2022-07-23 04:22:22,427 INFO L78 Accepts]: Start accepts. Automaton has 3955 states and 5247 transitions. Word has length 211 [2022-07-23 04:22:22,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:22:22,428 INFO L495 AbstractCegarLoop]: Abstraction has 3955 states and 5247 transitions. [2022-07-23 04:22:22,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (32), 7 states have call predecessors, (32), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-23 04:22:22,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3955 states and 5247 transitions. [2022-07-23 04:22:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-07-23 04:22:22,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:22:22,431 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:22:22,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-23 04:22:22,431 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:22:22,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:22:22,431 INFO L85 PathProgramCache]: Analyzing trace with hash -464471811, now seen corresponding path program 1 times [2022-07-23 04:22:22,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:22:22,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905149202] [2022-07-23 04:22:22,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:22,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:22:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:22:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:22:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:22:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:22:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:22:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:22:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:22:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:22:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:22:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-23 04:22:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-23 04:22:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 04:22:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 04:22:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 04:22:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-23 04:22:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-23 04:22:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-23 04:22:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-23 04:22:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2022-07-23 04:22:22,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:22:22,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905149202] [2022-07-23 04:22:22,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905149202] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:22:22,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:22:22,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 04:22:22,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966524192] [2022-07-23 04:22:22,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:22:22,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:22:22,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:22:22,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:22:22,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:22:22,799 INFO L87 Difference]: Start difference. First operand 3955 states and 5247 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2022-07-23 04:22:32,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:22:32,642 INFO L93 Difference]: Finished difference Result 4157 states and 5549 transitions. [2022-07-23 04:22:32,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 04:22:32,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) Word has length 217 [2022-07-23 04:22:32,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:22:32,664 INFO L225 Difference]: With dead ends: 4157 [2022-07-23 04:22:32,665 INFO L226 Difference]: Without dead ends: 4155 [2022-07-23 04:22:32,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-07-23 04:22:32,691 INFO L413 NwaCegarLoop]: 2136 mSDtfsCounter, 4567 mSDsluCounter, 2895 mSDsCounter, 0 mSdLazyCounter, 7448 mSolverCounterSat, 3049 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4567 SdHoareTripleChecker+Valid, 5031 SdHoareTripleChecker+Invalid, 10497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3049 IncrementalHoareTripleChecker+Valid, 7448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:22:32,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4567 Valid, 5031 Invalid, 10497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3049 Valid, 7448 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2022-07-23 04:22:32,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2022-07-23 04:22:32,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 3953. [2022-07-23 04:22:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3953 states, 2748 states have (on average 1.2263464337700145) internal successors, (3370), 2823 states have internal predecessors, (3370), 938 states have call successors, (938), 263 states have call predecessors, (938), 262 states have return successors, (936), 931 states have call predecessors, (936), 936 states have call successors, (936) [2022-07-23 04:22:32,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 5244 transitions. [2022-07-23 04:22:32,960 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 5244 transitions. Word has length 217 [2022-07-23 04:22:32,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:22:32,961 INFO L495 AbstractCegarLoop]: Abstraction has 3953 states and 5244 transitions. [2022-07-23 04:22:32,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2022-07-23 04:22:32,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 5244 transitions. [2022-07-23 04:22:32,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-23 04:22:32,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:22:32,964 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:22:32,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-23 04:22:32,964 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:22:32,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:22:32,964 INFO L85 PathProgramCache]: Analyzing trace with hash -965782681, now seen corresponding path program 1 times [2022-07-23 04:22:32,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:22:32,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217412382] [2022-07-23 04:22:32,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:32,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:22:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:22:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:22:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:22:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:22:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:22:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:22:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:22:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:22:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:22:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:22:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:22:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:22:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:22:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:22:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:22:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:22:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:22:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:22:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:22:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:22:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:22:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:22:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:22:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:22:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 04:22:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-23 04:22:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:22:33,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:22:33,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217412382] [2022-07-23 04:22:33,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217412382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:22:33,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:22:33,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:22:33,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069748102] [2022-07-23 04:22:33,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:22:33,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:22:33,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:22:33,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:22:33,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:22:33,140 INFO L87 Difference]: Start difference. First operand 3953 states and 5244 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-23 04:22:38,150 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-23 04:22:38,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:22:38,490 INFO L93 Difference]: Finished difference Result 3953 states and 5244 transitions. [2022-07-23 04:22:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:22:38,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2022-07-23 04:22:38,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:22:38,505 INFO L225 Difference]: With dead ends: 3953 [2022-07-23 04:22:38,505 INFO L226 Difference]: Without dead ends: 3760 [2022-07-23 04:22:38,510 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-23 04:22:38,511 INFO L413 NwaCegarLoop]: 2140 mSDtfsCounter, 4048 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2546 mSolverCounterSat, 2112 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4167 SdHoareTripleChecker+Valid, 3344 SdHoareTripleChecker+Invalid, 4659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2546 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:22:38,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4167 Valid, 3344 Invalid, 4659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2546 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2022-07-23 04:22:38,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2022-07-23 04:22:38,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 3760. [2022-07-23 04:22:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3760 states, 2630 states have (on average 1.2342205323193916) internal successors, (3246), 2702 states have internal predecessors, (3246), 883 states have call successors, (883), 243 states have call predecessors, (883), 243 states have return successors, (883), 878 states have call predecessors, (883), 883 states have call successors, (883) [2022-07-23 04:22:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3760 states and 5012 transitions. [2022-07-23 04:22:38,772 INFO L78 Accepts]: Start accepts. Automaton has 3760 states and 5012 transitions. Word has length 180 [2022-07-23 04:22:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:22:38,772 INFO L495 AbstractCegarLoop]: Abstraction has 3760 states and 5012 transitions. [2022-07-23 04:22:38,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-23 04:22:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 5012 transitions. [2022-07-23 04:22:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-07-23 04:22:38,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:22:38,779 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:22:38,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-23 04:22:38,779 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:22:38,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:22:38,779 INFO L85 PathProgramCache]: Analyzing trace with hash 862312457, now seen corresponding path program 1 times [2022-07-23 04:22:38,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:22:38,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069353564] [2022-07-23 04:22:38,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:22:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:22:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:22:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:22:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:22:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:22:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:22:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:22:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:22:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:22:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:38,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-23 04:22:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:39,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-23 04:22:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:39,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:39,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 04:22:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:39,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 04:22:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:39,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 04:22:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:39,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:22:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:39,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:39,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:39,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:39,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:39,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:22:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:39,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-23 04:22:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:39,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:22:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:39,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-23 04:22:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:39,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-23 04:22:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:39,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-23 04:22:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-07-23 04:22:39,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:22:39,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069353564] [2022-07-23 04:22:39,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069353564] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:22:39,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:22:39,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:22:39,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871392509] [2022-07-23 04:22:39,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:22:39,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:22:39,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:22:39,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:22:39,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:22:39,118 INFO L87 Difference]: Start difference. First operand 3760 states and 5012 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (34), 6 states have call predecessors, (34), 2 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-23 04:22:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:22:45,581 INFO L93 Difference]: Finished difference Result 8820 states and 11982 transitions. [2022-07-23 04:22:45,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 04:22:45,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (34), 6 states have call predecessors, (34), 2 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 227 [2022-07-23 04:22:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:22:45,598 INFO L225 Difference]: With dead ends: 8820 [2022-07-23 04:22:45,598 INFO L226 Difference]: Without dead ends: 5079 [2022-07-23 04:22:45,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2022-07-23 04:22:45,610 INFO L413 NwaCegarLoop]: 1933 mSDtfsCounter, 5363 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 3806 mSolverCounterSat, 3477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5363 SdHoareTripleChecker+Valid, 3567 SdHoareTripleChecker+Invalid, 7283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3477 IncrementalHoareTripleChecker+Valid, 3806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:22:45,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5363 Valid, 3567 Invalid, 7283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3477 Valid, 3806 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-23 04:22:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5079 states. [2022-07-23 04:22:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5079 to 3784. [2022-07-23 04:22:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3784 states, 2646 states have (on average 1.2343159486016628) internal successors, (3266), 2714 states have internal predecessors, (3266), 891 states have call successors, (891), 243 states have call predecessors, (891), 243 states have return successors, (891), 886 states have call predecessors, (891), 891 states have call successors, (891) [2022-07-23 04:22:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5048 transitions. [2022-07-23 04:22:45,847 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5048 transitions. Word has length 227 [2022-07-23 04:22:45,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:22:45,848 INFO L495 AbstractCegarLoop]: Abstraction has 3784 states and 5048 transitions. [2022-07-23 04:22:45,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (34), 6 states have call predecessors, (34), 2 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-23 04:22:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5048 transitions. [2022-07-23 04:22:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-07-23 04:22:45,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:22:45,851 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:22:45,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-23 04:22:45,851 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:22:45,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:22:45,851 INFO L85 PathProgramCache]: Analyzing trace with hash 125964688, now seen corresponding path program 1 times [2022-07-23 04:22:45,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:22:45,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872862124] [2022-07-23 04:22:45,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:45,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:22:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:45,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:22:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:45,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:22:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:45,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:45,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:22:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:45,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:45,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:45,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:45,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:22:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:45,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:45,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:45,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:45,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:22:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:45,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:45,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:45,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:45,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:22:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:22:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:22:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:22:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-23 04:22:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-23 04:22:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 04:22:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 04:22:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 04:22:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:22:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:22:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-23 04:22:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:22:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:22:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:22:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-23 04:22:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-23 04:22:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-23 04:22:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-07-23 04:22:46,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:22:46,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872862124] [2022-07-23 04:22:46,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872862124] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:22:46,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703904951] [2022-07-23 04:22:46,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:46,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:22:46,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:22:46,136 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-23 04:22:46,176 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-23 04:22:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:46,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 2521 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-23 04:22:46,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:22:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2022-07-23 04:22:47,145 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:22:47,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703904951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:22:47,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:22:47,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [9] total 22 [2022-07-23 04:22:47,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39198358] [2022-07-23 04:22:47,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:22:47,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 04:22:47,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:22:47,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 04:22:47,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2022-07-23 04:22:47,146 INFO L87 Difference]: Start difference. First operand 3784 states and 5048 transitions. Second operand has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 6 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2022-07-23 04:22:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:22:48,336 INFO L93 Difference]: Finished difference Result 8040 states and 10767 transitions. [2022-07-23 04:22:48,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 04:22:48,337 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 6 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) Word has length 239 [2022-07-23 04:22:48,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:22:48,355 INFO L225 Difference]: With dead ends: 8040 [2022-07-23 04:22:48,356 INFO L226 Difference]: Without dead ends: 4274 [2022-07-23 04:22:48,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2022-07-23 04:22:48,370 INFO L413 NwaCegarLoop]: 2609 mSDtfsCounter, 1381 mSDsluCounter, 32051 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 34660 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:22:48,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 34660 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 04:22:48,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4274 states. [2022-07-23 04:22:48,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4274 to 3812. [2022-07-23 04:22:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3812 states, 2666 states have (on average 1.2333083270817704) internal successors, (3288), 2734 states have internal predecessors, (3288), 899 states have call successors, (899), 243 states have call predecessors, (899), 243 states have return successors, (899), 893 states have call predecessors, (899), 899 states have call successors, (899) [2022-07-23 04:22:48,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3812 states to 3812 states and 5086 transitions. [2022-07-23 04:22:48,664 INFO L78 Accepts]: Start accepts. Automaton has 3812 states and 5086 transitions. Word has length 239 [2022-07-23 04:22:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:22:48,664 INFO L495 AbstractCegarLoop]: Abstraction has 3812 states and 5086 transitions. [2022-07-23 04:22:48,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 6 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2022-07-23 04:22:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3812 states and 5086 transitions. [2022-07-23 04:22:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2022-07-23 04:22:48,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:22:48,670 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:22:48,703 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-23 04:22:48,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-23 04:22:48,896 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:22:48,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:22:48,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1053085854, now seen corresponding path program 1 times [2022-07-23 04:22:48,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:22:48,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254841972] [2022-07-23 04:22:48,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:48,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:22:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:22:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:22:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:22:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:22:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:22:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:22:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:22:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:22:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:22:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:22:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-23 04:22:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 04:22:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 04:22:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-23 04:22:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-23 04:22:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-23 04:22:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-23 04:22:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-23 04:22:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-23 04:22:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-23 04:22:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-23 04:22:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-23 04:22:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-23 04:22:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:22:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-23 04:22:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:22:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:22:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:22:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-23 04:22:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-23 04:22:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-07-23 04:22:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:49,215 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2022-07-23 04:22:49,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:22:49,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254841972] [2022-07-23 04:22:49,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254841972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:22:49,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:22:49,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 04:22:49,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847902532] [2022-07-23 04:22:49,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:22:49,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 04:22:49,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:22:49,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 04:22:49,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:22:49,217 INFO L87 Difference]: Start difference. First operand 3812 states and 5086 transitions. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (44), 7 states have call predecessors, (44), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-23 04:22:59,215 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-23 04:23:00,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:23:00,909 INFO L93 Difference]: Finished difference Result 8328 states and 11225 transitions. [2022-07-23 04:23:00,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 04:23:00,910 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (44), 7 states have call predecessors, (44), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 304 [2022-07-23 04:23:00,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:23:00,926 INFO L225 Difference]: With dead ends: 8328 [2022-07-23 04:23:00,927 INFO L226 Difference]: Without dead ends: 4535 [2022-07-23 04:23:00,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2022-07-23 04:23:00,938 INFO L413 NwaCegarLoop]: 1981 mSDtfsCounter, 5513 mSDsluCounter, 2607 mSDsCounter, 0 mSdLazyCounter, 7575 mSolverCounterSat, 3980 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5515 SdHoareTripleChecker+Valid, 4588 SdHoareTripleChecker+Invalid, 11556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3980 IncrementalHoareTripleChecker+Valid, 7575 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:23:00,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5515 Valid, 4588 Invalid, 11556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3980 Valid, 7575 Invalid, 1 Unknown, 0 Unchecked, 11.1s Time] [2022-07-23 04:23:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2022-07-23 04:23:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 3815. [2022-07-23 04:23:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3815 states, 2669 states have (on average 1.2330460846759086) internal successors, (3291), 2737 states have internal predecessors, (3291), 899 states have call successors, (899), 243 states have call predecessors, (899), 243 states have return successors, (899), 893 states have call predecessors, (899), 899 states have call successors, (899) [2022-07-23 04:23:01,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 5089 transitions. [2022-07-23 04:23:01,185 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 5089 transitions. Word has length 304 [2022-07-23 04:23:01,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:23:01,186 INFO L495 AbstractCegarLoop]: Abstraction has 3815 states and 5089 transitions. [2022-07-23 04:23:01,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (44), 7 states have call predecessors, (44), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-23 04:23:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 5089 transitions. [2022-07-23 04:23:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-07-23 04:23:01,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:23:01,189 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:23:01,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-23 04:23:01,190 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:23:01,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:23:01,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1459983746, now seen corresponding path program 1 times [2022-07-23 04:23:01,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:23:01,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664561259] [2022-07-23 04:23:01,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:23:01,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:23:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:23:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:23:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:23:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:23:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:23:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:23:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:23:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:23:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:23:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:23:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:23:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-23 04:23:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 04:23:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 04:23:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-23 04:23:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-23 04:23:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-23 04:23:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-23 04:23:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:23:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:23:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-23 04:23:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:23:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:23:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-23 04:23:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-23 04:23:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:23:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:23:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-23 04:23:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:23:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:23:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:23:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-07-23 04:23:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-07-23 04:23:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2022-07-23 04:23:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2022-07-23 04:23:01,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:23:01,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664561259] [2022-07-23 04:23:01,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664561259] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:23:01,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352361755] [2022-07-23 04:23:01,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:23:01,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:23:01,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:23:01,567 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-23 04:23:01,569 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-23 04:23:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:02,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 3079 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-23 04:23:02,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:23:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-07-23 04:23:02,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:23:02,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352361755] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:23:02,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:23:02,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [10] total 23 [2022-07-23 04:23:02,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269930025] [2022-07-23 04:23:02,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:23:02,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 04:23:02,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:23:02,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 04:23:02,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2022-07-23 04:23:02,576 INFO L87 Difference]: Start difference. First operand 3815 states and 5089 transitions. Second operand has 15 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 7 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (41), 7 states have call predecessors, (41), 7 states have call successors, (41) [2022-07-23 04:23:03,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:23:03,747 INFO L93 Difference]: Finished difference Result 8541 states and 11471 transitions. [2022-07-23 04:23:03,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 04:23:03,748 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 7 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (41), 7 states have call predecessors, (41), 7 states have call successors, (41) Word has length 325 [2022-07-23 04:23:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:23:03,770 INFO L225 Difference]: With dead ends: 8541 [2022-07-23 04:23:03,770 INFO L226 Difference]: Without dead ends: 4744 [2022-07-23 04:23:03,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=1278, Unknown=0, NotChecked=0, Total=1482 [2022-07-23 04:23:03,783 INFO L413 NwaCegarLoop]: 2662 mSDtfsCounter, 1387 mSDsluCounter, 32684 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1458 SdHoareTripleChecker+Valid, 35346 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:23:03,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1458 Valid, 35346 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 04:23:03,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2022-07-23 04:23:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 3810. [2022-07-23 04:23:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3810 states, 2667 states have (on average 1.2332208473940758) internal successors, (3289), 2735 states have internal predecessors, (3289), 896 states have call successors, (896), 243 states have call predecessors, (896), 243 states have return successors, (896), 890 states have call predecessors, (896), 896 states have call successors, (896) [2022-07-23 04:23:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3810 states to 3810 states and 5081 transitions. [2022-07-23 04:23:04,167 INFO L78 Accepts]: Start accepts. Automaton has 3810 states and 5081 transitions. Word has length 325 [2022-07-23 04:23:04,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:23:04,167 INFO L495 AbstractCegarLoop]: Abstraction has 3810 states and 5081 transitions. [2022-07-23 04:23:04,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 7 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (41), 7 states have call predecessors, (41), 7 states have call successors, (41) [2022-07-23 04:23:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3810 states and 5081 transitions. [2022-07-23 04:23:04,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2022-07-23 04:23:04,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:23:04,170 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:23:04,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-23 04:23:04,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:23:04,388 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:23:04,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:23:04,388 INFO L85 PathProgramCache]: Analyzing trace with hash -445733852, now seen corresponding path program 1 times [2022-07-23 04:23:04,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:23:04,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997674240] [2022-07-23 04:23:04,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:23:04,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:23:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:23:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:23:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:23:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:23:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:23:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:23:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:23:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:23:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:23:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:23:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:23:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-23 04:23:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 04:23:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 04:23:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-23 04:23:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:23:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:23:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-23 04:23:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-23 04:23:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:23:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:23:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-23 04:23:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:23:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:23:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:23:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-07-23 04:23:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-23 04:23:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-23 04:23:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-07-23 04:23:04,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:23:04,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997674240] [2022-07-23 04:23:04,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997674240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:23:04,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:23:04,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-23 04:23:04,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475450694] [2022-07-23 04:23:04,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:23:04,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 04:23:04,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:23:04,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 04:23:04,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-07-23 04:23:04,981 INFO L87 Difference]: Start difference. First operand 3810 states and 5081 transitions. Second operand has 15 states, 15 states have (on average 8.466666666666667) internal successors, (127), 11 states have internal predecessors, (127), 2 states have call successors, (35), 5 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-23 04:23:08,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:23:11,207 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-23 04:23:34,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:23:34,734 INFO L93 Difference]: Finished difference Result 6950 states and 9731 transitions. [2022-07-23 04:23:34,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-23 04:23:34,735 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.466666666666667) internal successors, (127), 11 states have internal predecessors, (127), 2 states have call successors, (35), 5 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 307 [2022-07-23 04:23:34,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:23:34,783 INFO L225 Difference]: With dead ends: 6950 [2022-07-23 04:23:34,783 INFO L226 Difference]: Without dead ends: 6948 [2022-07-23 04:23:34,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=872, Invalid=4678, Unknown=0, NotChecked=0, Total=5550 [2022-07-23 04:23:34,792 INFO L413 NwaCegarLoop]: 3466 mSDtfsCounter, 7274 mSDsluCounter, 14919 mSDsCounter, 0 mSdLazyCounter, 26647 mSolverCounterSat, 5348 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7532 SdHoareTripleChecker+Valid, 18385 SdHoareTripleChecker+Invalid, 31996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5348 IncrementalHoareTripleChecker+Valid, 26647 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:23:34,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7532 Valid, 18385 Invalid, 31996 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5348 Valid, 26647 Invalid, 1 Unknown, 0 Unchecked, 27.7s Time] [2022-07-23 04:23:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6948 states. [2022-07-23 04:23:35,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6948 to 3819. [2022-07-23 04:23:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3819 states, 2676 states have (on average 1.2328101644245142) internal successors, (3299), 2743 states have internal predecessors, (3299), 896 states have call successors, (896), 243 states have call predecessors, (896), 243 states have return successors, (896), 891 states have call predecessors, (896), 896 states have call successors, (896) [2022-07-23 04:23:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3819 states to 3819 states and 5091 transitions. [2022-07-23 04:23:35,170 INFO L78 Accepts]: Start accepts. Automaton has 3819 states and 5091 transitions. Word has length 307 [2022-07-23 04:23:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:23:35,170 INFO L495 AbstractCegarLoop]: Abstraction has 3819 states and 5091 transitions. [2022-07-23 04:23:35,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.466666666666667) internal successors, (127), 11 states have internal predecessors, (127), 2 states have call successors, (35), 5 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-23 04:23:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3819 states and 5091 transitions. [2022-07-23 04:23:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-07-23 04:23:35,173 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:23:35,173 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 9, 9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:23:35,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-23 04:23:35,174 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:23:35,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:23:35,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1555187807, now seen corresponding path program 1 times [2022-07-23 04:23:35,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:23:35,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095421212] [2022-07-23 04:23:35,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:23:35,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:23:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:23:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:23:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:23:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:23:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:23:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:23:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:23:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:23:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:23:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:23:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:23:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-23 04:23:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 04:23:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 04:23:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-23 04:23:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:23:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:23:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-23 04:23:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-23 04:23:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:23:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:23:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-23 04:23:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:23:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:23:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:23:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-07-23 04:23:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-23 04:23:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-23 04:23:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-07-23 04:23:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 04:23:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 04:23:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-07-23 04:23:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-07-23 04:23:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2022-07-23 04:23:35,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:23:35,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095421212] [2022-07-23 04:23:35,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095421212] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:23:35,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:23:35,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-23 04:23:35,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161187691] [2022-07-23 04:23:35,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:23:35,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 04:23:35,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:23:35,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 04:23:35,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-07-23 04:23:35,752 INFO L87 Difference]: Start difference. First operand 3819 states and 5091 transitions. Second operand has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 13 states have internal predecessors, (145), 2 states have call successors, (42), 6 states have call predecessors, (42), 2 states have return successors, (42), 3 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-23 04:23:39,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:23:58,418 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:24:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:24:10,871 INFO L93 Difference]: Finished difference Result 8522 states and 12102 transitions. [2022-07-23 04:24:10,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-07-23 04:24:10,871 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 13 states have internal predecessors, (145), 2 states have call successors, (42), 6 states have call predecessors, (42), 2 states have return successors, (42), 3 states have call predecessors, (42), 2 states have call successors, (42) Word has length 353 [2022-07-23 04:24:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:24:10,897 INFO L225 Difference]: With dead ends: 8522 [2022-07-23 04:24:10,897 INFO L226 Difference]: Without dead ends: 8520 [2022-07-23 04:24:10,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2309 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=976, Invalid=6856, Unknown=0, NotChecked=0, Total=7832 [2022-07-23 04:24:10,904 INFO L413 NwaCegarLoop]: 3751 mSDtfsCounter, 8227 mSDsluCounter, 22640 mSDsCounter, 0 mSdLazyCounter, 35778 mSolverCounterSat, 6674 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8466 SdHoareTripleChecker+Valid, 26391 SdHoareTripleChecker+Invalid, 42452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6674 IncrementalHoareTripleChecker+Valid, 35778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:24:10,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8466 Valid, 26391 Invalid, 42452 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6674 Valid, 35778 Invalid, 0 Unknown, 0 Unchecked, 32.4s Time] [2022-07-23 04:24:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8520 states. [2022-07-23 04:24:11,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8520 to 3949. [2022-07-23 04:24:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3949 states, 2775 states have (on average 1.2327927927927929) internal successors, (3421), 2847 states have internal predecessors, (3421), 926 states have call successors, (926), 243 states have call predecessors, (926), 244 states have return successors, (929), 921 states have call predecessors, (929), 926 states have call successors, (929) [2022-07-23 04:24:11,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 5276 transitions. [2022-07-23 04:24:11,429 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 5276 transitions. Word has length 353 [2022-07-23 04:24:11,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:24:11,429 INFO L495 AbstractCegarLoop]: Abstraction has 3949 states and 5276 transitions. [2022-07-23 04:24:11,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 13 states have internal predecessors, (145), 2 states have call successors, (42), 6 states have call predecessors, (42), 2 states have return successors, (42), 3 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-23 04:24:11,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 5276 transitions. [2022-07-23 04:24:11,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2022-07-23 04:24:11,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:24:11,434 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:24:11,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-23 04:24:11,434 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:24:11,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:24:11,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1868564358, now seen corresponding path program 1 times [2022-07-23 04:24:11,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:24:11,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873686140] [2022-07-23 04:24:11,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:24:11,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:24:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:24:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:24:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:24:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:24:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:24:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:24:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:24:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:24:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:24:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:24:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:24:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-23 04:24:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 04:24:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 04:24:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-23 04:24:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:24:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:24:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-23 04:24:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-23 04:24:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:24:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:24:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-23 04:24:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:24:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:24:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:24:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-07-23 04:24:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-23 04:24:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-23 04:24:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-07-23 04:24:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-07-23 04:24:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2022-07-23 04:24:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-07-23 04:24:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-23 04:24:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2022-07-23 04:24:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-23 04:24:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-07-23 04:24:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2022-07-23 04:24:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-07-23 04:24:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2022-07-23 04:24:11,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:24:11,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873686140] [2022-07-23 04:24:11,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873686140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:24:11,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:24:11,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 04:24:11,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111751224] [2022-07-23 04:24:11,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:24:11,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 04:24:11,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:24:11,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 04:24:11,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:24:11,821 INFO L87 Difference]: Start difference. First operand 3949 states and 5276 transitions. Second operand has 10 states, 10 states have (on average 14.9) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (49), 7 states have call predecessors, (49), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2022-07-23 04:24:18,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:24:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:24:21,956 INFO L93 Difference]: Finished difference Result 8753 states and 11828 transitions. [2022-07-23 04:24:21,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 04:24:21,957 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.9) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (49), 7 states have call predecessors, (49), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 386 [2022-07-23 04:24:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:24:21,971 INFO L225 Difference]: With dead ends: 8753 [2022-07-23 04:24:21,971 INFO L226 Difference]: Without dead ends: 4823 [2022-07-23 04:24:21,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2022-07-23 04:24:21,982 INFO L413 NwaCegarLoop]: 2065 mSDtfsCounter, 5835 mSDsluCounter, 3213 mSDsCounter, 0 mSdLazyCounter, 8391 mSolverCounterSat, 4228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5850 SdHoareTripleChecker+Valid, 5278 SdHoareTripleChecker+Invalid, 12619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4228 IncrementalHoareTripleChecker+Valid, 8391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:24:21,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5850 Valid, 5278 Invalid, 12619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4228 Valid, 8391 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2022-07-23 04:24:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4823 states. [2022-07-23 04:24:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4823 to 3952. [2022-07-23 04:24:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 2778 states have (on average 1.232541396688265) internal successors, (3424), 2850 states have internal predecessors, (3424), 926 states have call successors, (926), 243 states have call predecessors, (926), 244 states have return successors, (929), 921 states have call predecessors, (929), 926 states have call successors, (929) [2022-07-23 04:24:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 5279 transitions. [2022-07-23 04:24:22,459 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 5279 transitions. Word has length 386 [2022-07-23 04:24:22,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:24:22,460 INFO L495 AbstractCegarLoop]: Abstraction has 3952 states and 5279 transitions. [2022-07-23 04:24:22,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.9) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (49), 7 states have call predecessors, (49), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2022-07-23 04:24:22,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 5279 transitions. [2022-07-23 04:24:22,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2022-07-23 04:24:22,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:24:22,464 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 9, 9, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:24:22,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-23 04:24:22,465 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:24:22,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:24:22,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1028228677, now seen corresponding path program 1 times [2022-07-23 04:24:22,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:24:22,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790562996] [2022-07-23 04:24:22,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:24:22,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:24:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:24:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:24:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:24:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:24:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:24:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:24:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:24:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:24:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:24:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:24:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:24:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-23 04:24:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 04:24:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 04:24:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-23 04:24:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:24:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:24:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-23 04:24:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-23 04:24:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:24:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:24:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-23 04:24:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:24:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:24:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:24:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-23 04:24:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-23 04:24:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-23 04:24:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-23 04:24:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-07-23 04:24:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-07-23 04:24:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-07-23 04:24:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-07-23 04:24:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-07-23 04:24:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-07-23 04:24:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-07-23 04:24:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2022-07-23 04:24:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2022-07-23 04:24:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-07-23 04:24:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-23 04:24:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2022-07-23 04:24:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2022-07-23 04:24:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2022-07-23 04:24:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2022-07-23 04:24:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 418 [2022-07-23 04:24:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2022-07-23 04:24:22,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:24:22,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790562996] [2022-07-23 04:24:22,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790562996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:24:22,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:24:22,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 04:24:22,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66242338] [2022-07-23 04:24:22,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:24:22,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 04:24:22,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:24:22,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 04:24:22,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:24:22,959 INFO L87 Difference]: Start difference. First operand 3952 states and 5279 transitions. Second operand has 10 states, 10 states have (on average 16.4) internal successors, (164), 4 states have internal predecessors, (164), 2 states have call successors, (56), 7 states have call predecessors, (56), 2 states have return successors, (52), 3 states have call predecessors, (52), 2 states have call successors, (52) [2022-07-23 04:24:32,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:24:32,833 INFO L93 Difference]: Finished difference Result 8709 states and 11770 transitions. [2022-07-23 04:24:32,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 04:24:32,834 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.4) internal successors, (164), 4 states have internal predecessors, (164), 2 states have call successors, (56), 7 states have call predecessors, (56), 2 states have return successors, (52), 3 states have call predecessors, (52), 2 states have call successors, (52) Word has length 427 [2022-07-23 04:24:32,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:24:32,853 INFO L225 Difference]: With dead ends: 8709 [2022-07-23 04:24:32,853 INFO L226 Difference]: Without dead ends: 4776 [2022-07-23 04:24:32,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-07-23 04:24:32,863 INFO L413 NwaCegarLoop]: 2030 mSDtfsCounter, 5715 mSDsluCounter, 3241 mSDsCounter, 0 mSdLazyCounter, 8248 mSolverCounterSat, 4115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5740 SdHoareTripleChecker+Valid, 5271 SdHoareTripleChecker+Invalid, 12363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4115 IncrementalHoareTripleChecker+Valid, 8248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:24:32,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5740 Valid, 5271 Invalid, 12363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4115 Valid, 8248 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2022-07-23 04:24:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4776 states. [2022-07-23 04:24:33,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4776 to 3956. [2022-07-23 04:24:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 2781 states have (on average 1.2322905429701547) internal successors, (3427), 2853 states have internal predecessors, (3427), 926 states have call successors, (926), 243 states have call predecessors, (926), 245 states have return successors, (933), 922 states have call predecessors, (933), 926 states have call successors, (933) [2022-07-23 04:24:33,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 5286 transitions. [2022-07-23 04:24:33,328 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 5286 transitions. Word has length 427 [2022-07-23 04:24:33,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:24:33,329 INFO L495 AbstractCegarLoop]: Abstraction has 3956 states and 5286 transitions. [2022-07-23 04:24:33,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.4) internal successors, (164), 4 states have internal predecessors, (164), 2 states have call successors, (56), 7 states have call predecessors, (56), 2 states have return successors, (52), 3 states have call predecessors, (52), 2 states have call successors, (52) [2022-07-23 04:24:33,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 5286 transitions. [2022-07-23 04:24:33,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2022-07-23 04:24:33,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:24:33,333 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 11, 11, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:24:33,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-23 04:24:33,333 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:24:33,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:24:33,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1712616577, now seen corresponding path program 1 times [2022-07-23 04:24:33,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:24:33,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186463124] [2022-07-23 04:24:33,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:24:33,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:24:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:24:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:24:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:24:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:24:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:24:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:24:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:24:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:24:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:24:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:24:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:24:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-23 04:24:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 04:24:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 04:24:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-23 04:24:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:24:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:24:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-23 04:24:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-23 04:24:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:24:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:24:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-23 04:24:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:24:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:24:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:24:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:24:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-23 04:24:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:24:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-07-23 04:24:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-07-23 04:24:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-07-23 04:24:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-07-23 04:24:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-23 04:24:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2022-07-23 04:24:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2022-07-23 04:24:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-07-23 04:24:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-07-23 04:24:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2022-07-23 04:24:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2022-07-23 04:24:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-23 04:24:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2022-07-23 04:24:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2022-07-23 04:24:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 388 [2022-07-23 04:24:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:33,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat