./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 eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--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-?-eb692b5 [2022-07-20 04:04:50,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 04:04:50,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 04:04:50,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 04:04:50,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 04:04:50,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 04:04:50,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 04:04:50,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 04:04:50,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 04:04:50,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 04:04:50,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 04:04:50,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 04:04:50,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 04:04:50,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 04:04:50,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 04:04:50,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 04:04:50,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 04:04:50,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 04:04:50,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 04:04:50,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 04:04:50,635 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 04:04:50,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 04:04:50,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 04:04:50,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 04:04:50,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 04:04:50,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 04:04:50,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 04:04:50,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 04:04:50,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 04:04:50,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 04:04:50,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 04:04:50,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 04:04:50,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 04:04:50,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 04:04:50,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 04:04:50,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 04:04:50,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 04:04:50,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 04:04:50,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 04:04:50,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 04:04:50,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 04:04:50,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 04:04:50,651 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 04:04:50,671 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 04:04:50,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 04:04:50,672 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 04:04:50,672 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 04:04:50,673 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 04:04:50,673 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 04:04:50,674 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 04:04:50,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 04:04:50,674 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 04:04:50,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 04:04:50,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 04:04:50,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 04:04:50,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 04:04:50,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 04:04:50,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 04:04:50,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 04:04:50,676 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 04:04:50,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 04:04:50,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 04:04:50,676 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 04:04:50,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 04:04:50,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:04:50,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 04:04:50,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 04:04:50,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 04:04:50,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 04:04:50,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 04:04:50,677 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 04:04:50,678 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 04:04:50,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 04:04:50,678 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-20 04:04:50,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 04:04:50,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 04:04:50,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 04:04:50,923 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 04:04:50,924 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 04:04:50,925 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-20 04:04:50,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7a7316cc/0969daa4e84c4abb85c4c59904cda630/FLAG12ac8c382 [2022-07-20 04:04:51,658 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 04:04:51,658 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-20 04:04:51,713 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7a7316cc/0969daa4e84c4abb85c4c59904cda630/FLAG12ac8c382 [2022-07-20 04:04:52,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7a7316cc/0969daa4e84c4abb85c4c59904cda630 [2022-07-20 04:04:52,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 04:04:52,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 04:04:52,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 04:04:52,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 04:04:52,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 04:04:52,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:04:52" (1/1) ... [2022-07-20 04:04:52,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e95ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:04:52, skipping insertion in model container [2022-07-20 04:04:52,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:04:52" (1/1) ... [2022-07-20 04:04:52,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 04:04:52,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 04:04:55,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,083 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,083 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,095 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,095 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,095 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:04:55,155 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 04:04:55,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,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[396756,396769] [2022-07-20 04:04:55,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,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[397506,397519] [2022-07-20 04:04:55,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[397652,397665] [2022-07-20 04:04:55,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[397797,397810] [2022-07-20 04:04:55,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[397951,397964] [2022-07-20 04:04:55,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[398102,398115] [2022-07-20 04:04:55,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[398257,398270] [2022-07-20 04:04:55,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[398409,398422] [2022-07-20 04:04:55,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[398564,398577] [2022-07-20 04:04:55,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[398728,398741] [2022-07-20 04:04:55,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[398884,398897] [2022-07-20 04:04:55,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[399048,399061] [2022-07-20 04:04:55,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[399190,399203] [2022-07-20 04:04:55,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[399348,399361] [2022-07-20 04:04:55,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[399515,399528] [2022-07-20 04:04:55,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[399674,399687] [2022-07-20 04:04:55,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[399833,399846] [2022-07-20 04:04:55,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[399982,399995] [2022-07-20 04:04:55,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[400129,400142] [2022-07-20 04:04:55,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[400268,400281] [2022-07-20 04:04:55,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[400431,400444] [2022-07-20 04:04:55,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[400597,400610] [2022-07-20 04:04:55,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[400761,400774] [2022-07-20 04:04:55,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[400926,400939] [2022-07-20 04:04:55,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[401091,401104] [2022-07-20 04:04:55,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[401257,401270] [2022-07-20 04:04:55,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[401422,401435] [2022-07-20 04:04:55,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-20 04:04:55,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[402070,402083] [2022-07-20 04:04:55,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[402216,402229] [2022-07-20 04:04:55,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[402359,402372] [2022-07-20 04:04:55,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[402503,402516] [2022-07-20 04:04:55,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[402646,402659] [2022-07-20 04:04:55,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[402790,402803] [2022-07-20 04:04:55,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[402931,402944] [2022-07-20 04:04:55,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[403069,403082] [2022-07-20 04:04:55,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[403227,403240] [2022-07-20 04:04:55,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[403386,403399] [2022-07-20 04:04:55,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[403542,403555] [2022-07-20 04:04:55,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[403691,403704] [2022-07-20 04:04:55,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[403843,403856] [2022-07-20 04:04:55,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[403994,404007] [2022-07-20 04:04:55,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[404143,404156] [2022-07-20 04:04:55,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[404295,404308] [2022-07-20 04:04:55,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[404443,404456] [2022-07-20 04:04:55,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[404596,404609] [2022-07-20 04:04:55,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[404747,404760] [2022-07-20 04:04:55,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[404897,404910] [2022-07-20 04:04:55,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[405044,405057] [2022-07-20 04:04:55,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[405195,405208] [2022-07-20 04:04:55,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[405346,405359] [2022-07-20 04:04:55,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[405494,405507] [2022-07-20 04:04:55,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[405660,405673] [2022-07-20 04:04:55,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[405829,405842] [2022-07-20 04:04:55,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[405996,406009] [2022-07-20 04:04:55,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[406164,406177] [2022-07-20 04:04:55,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[406314,406327] [2022-07-20 04:04:55,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[406461,406474] [2022-07-20 04:04:55,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[406622,406635] [2022-07-20 04:04:55,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[406792,406805] [2022-07-20 04:04:55,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[406954,406967] [2022-07-20 04:04:55,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:04:55,661 INFO L208 MainTranslator]: Completed translation [2022-07-20 04:04:55,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:04:55 WrapperNode [2022-07-20 04:04:55,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 04:04:55,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 04:04:55,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 04:04:55,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 04:04:55,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:04:55" (1/1) ... [2022-07-20 04:04:55,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:04:55" (1/1) ... [2022-07-20 04:04:55,898 INFO L137 Inliner]: procedures = 655, calls = 1960, calls flagged for inlining = 296, calls inlined = 213, statements flattened = 4413 [2022-07-20 04:04:55,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 04:04:55,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 04:04:55,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 04:04:55,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 04:04:55,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:04:55" (1/1) ... [2022-07-20 04:04:55,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:04:55" (1/1) ... [2022-07-20 04:04:55,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:04:55" (1/1) ... [2022-07-20 04:04:55,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:04:55" (1/1) ... [2022-07-20 04:04:56,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:04:55" (1/1) ... [2022-07-20 04:04:56,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:04:55" (1/1) ... [2022-07-20 04:04:56,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:04:55" (1/1) ... [2022-07-20 04:04:56,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 04:04:56,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 04:04:56,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 04:04:56,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 04:04:56,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:04:55" (1/1) ... [2022-07-20 04:04:56,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:04:56,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:04:56,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 04:04:56,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 04:04:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:04:56,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:04:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_write [2022-07-20 04:04:56,118 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_write [2022-07-20 04:04:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2022-07-20 04:04:56,118 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2022-07-20 04:04:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-20 04:04:56,118 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-20 04:04:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 04:04:56,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 04:04:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mii_mutex_of_ipg_nic_private [2022-07-20 04:04:56,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mii_mutex_of_ipg_nic_private [2022-07-20 04:04:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:04:56,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:04:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-20 04:04:56,119 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-20 04:04:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure init_tfdlist [2022-07-20 04:04:56,119 INFO L138 BoogieDeclarations]: Found implementation of procedure init_tfdlist [2022-07-20 04:04:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 04:04:56,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 04:04:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-07-20 04:04:56,120 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-07-20 04:04:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite16 [2022-07-20 04:04:56,120 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite16 [2022-07-20 04:04:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_set_multicast_list [2022-07-20 04:04:56,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_set_multicast_list [2022-07-20 04:04:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite8 [2022-07-20 04:04:56,120 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite8 [2022-07-20 04:04:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:04:56,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:04:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:04:56,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:04:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32 [2022-07-20 04:04:56,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32 [2022-07-20 04:04:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure pci_name [2022-07-20 04:04:56,121 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_name [2022-07-20 04:04:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_rx_clear [2022-07-20 04:04:56,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_rx_clear [2022-07-20 04:04:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure skb_checksum_none_assert [2022-07-20 04:04:56,121 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_checksum_none_assert [2022-07-20 04:04:56,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-20 04:04:56,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-20 04:04:56,122 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32 [2022-07-20 04:04:56,122 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32 [2022-07-20 04:04:56,122 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2022-07-20 04:04:56,122 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2022-07-20 04:04:56,122 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-07-20 04:04:56,122 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-07-20 04:04:56,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 04:04:56,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 04:04:56,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:04:56,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:04:56,123 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_single [2022-07-20 04:04:56,123 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_single [2022-07-20 04:04:56,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 04:04:56,123 INFO L130 BoogieDeclarations]: Found specification of procedure read_phy_bit [2022-07-20 04:04:56,123 INFO L138 BoogieDeclarations]: Found implementation of procedure read_phy_bit [2022-07-20 04:04:56,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:04:56,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:04:56,124 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_remove [2022-07-20 04:04:56,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_remove [2022-07-20 04:04:56,124 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-20 04:04:56,124 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-20 04:04:56,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-20 04:04:56,124 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-20 04:04:56,124 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-20 04:04:56,124 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_open [2022-07-20 04:04:56,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_open [2022-07-20 04:04:56,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 04:04:56,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-20 04:04:56,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-20 04:04:56,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-20 04:04:56,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-20 04:04:56,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:04:56,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:04:56,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 04:04:56,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:04:56,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:04:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-20 04:04:56,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-20 04:04:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-20 04:04:56,126 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-20 04:04:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:04:56,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:04:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-07-20 04:04:56,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-07-20 04:04:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-20 04:04:56,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-20 04:04:56,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-20 04:04:56,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-20 04:04:56,127 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_dma_mask [2022-07-20 04:04:56,127 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_set_dma_mask [2022-07-20 04:04:56,127 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-07-20 04:04:56,127 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-07-20 04:04:56,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:04:56,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:04:56,127 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-20 04:04:56,127 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-20 04:04:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:04:56,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:04:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_get_stats [2022-07-20 04:04:56,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_get_stats [2022-07-20 04:04:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_rxrestore [2022-07-20 04:04:56,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_rxrestore [2022-07-20 04:04:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 04:04:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_ipg_nic_private [2022-07-20 04:04:56,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_ipg_nic_private [2022-07-20 04:04:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 04:04:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-20 04:04:56,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-20 04:04:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-20 04:04:56,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-20 04:04:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 04:04:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure ioread16 [2022-07-20 04:04:56,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread16 [2022-07-20 04:04:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 04:04:56,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 04:04:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_ioaddr [2022-07-20 04:04:56,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_ioaddr [2022-07-20 04:04:56,130 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-20 04:04:56,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-20 04:04:56,130 INFO L130 BoogieDeclarations]: Found specification of procedure ioread8 [2022-07-20 04:04:56,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread8 [2022-07-20 04:04:56,130 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-20 04:04:56,130 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-20 04:04:56,130 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-20 04:04:56,130 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-20 04:04:56,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:04:56,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:04:56,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-20 04:04:56,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-20 04:04:56,131 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_get_rxbuff [2022-07-20 04:04:56,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_get_rxbuff [2022-07-20 04:04:56,131 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_write_phy_ctl [2022-07-20 04:04:56,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_write_phy_ctl [2022-07-20 04:04:56,131 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2022-07-20 04:04:56,131 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2022-07-20 04:04:56,131 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-20 04:04:56,131 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-20 04:04:56,132 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_drive_phy_ctl_low_high [2022-07-20 04:04:56,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_drive_phy_ctl_low_high [2022-07-20 04:04:56,132 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_read [2022-07-20 04:04:56,132 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_read [2022-07-20 04:04:56,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 04:04:56,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 04:04:56,132 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_txfree [2022-07-20 04:04:56,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_txfree [2022-07-20 04:04:56,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-20 04:04:56,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-20 04:04:56,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 04:04:56,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 04:04:56,133 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_tx_timeout [2022-07-20 04:04:56,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_tx_timeout [2022-07-20 04:04:56,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 04:04:56,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 04:04:56,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-07-20 04:04:56,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-07-20 04:04:56,133 INFO L130 BoogieDeclarations]: Found specification of procedure pci_map_single [2022-07-20 04:04:56,133 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_map_single [2022-07-20 04:04:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-20 04:04:56,134 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-20 04:04:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:04:56,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:04:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_tx_clear [2022-07-20 04:04:56,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_tx_clear [2022-07-20 04:04:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:04:56,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:04:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure read_eeprom [2022-07-20 04:04:56,134 INFO L138 BoogieDeclarations]: Found implementation of procedure read_eeprom [2022-07-20 04:04:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 04:04:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:04:56,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:04:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-20 04:04:56,135 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-20 04:04:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 04:04:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_rx_free_skb [2022-07-20 04:04:56,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_rx_free_skb [2022-07-20 04:04:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure send_three_state [2022-07-20 04:04:56,135 INFO L138 BoogieDeclarations]: Found implementation of procedure send_three_state [2022-07-20 04:04:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 04:04:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-20 04:04:56,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-20 04:04:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:04:56,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:04:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-20 04:04:56,136 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-20 04:04:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-20 04:04:56,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-20 04:04:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-20 04:04:56,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-20 04:04:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-07-20 04:04:56,137 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-07-20 04:04:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_io_config [2022-07-20 04:04:56,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_io_config [2022-07-20 04:04:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure init_rfdlist [2022-07-20 04:04:56,137 INFO L138 BoogieDeclarations]: Found implementation of procedure init_rfdlist [2022-07-20 04:04:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:04:56,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:04:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure dma_free_attrs [2022-07-20 04:04:56,137 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_free_attrs [2022-07-20 04:04:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-20 04:04:56,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-20 04:04:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:04:56,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:04:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-20 04:04:56,138 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-20 04:04:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-20 04:04:56,138 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-20 04:04:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:04:56,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:04:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-20 04:04:56,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-20 04:04:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 04:04:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:04:56,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:04:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure eth_type_trans [2022-07-20 04:04:56,139 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_type_trans [2022-07-20 04:04:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 04:04:56,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 04:04:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nway_reset [2022-07-20 04:04:56,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nway_reset [2022-07-20 04:04:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:04:56,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:04:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_stop [2022-07-20 04:04:56,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_stop [2022-07-20 04:04:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_config_autoneg [2022-07-20 04:04:56,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_config_autoneg [2022-07-20 04:04:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-20 04:04:56,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-20 04:04:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_reset [2022-07-20 04:04:56,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_reset [2022-07-20 04:04:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_ipg_nic_private [2022-07-20 04:04:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_ipg_nic_private [2022-07-20 04:04:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mii_mutex_of_ipg_nic_private [2022-07-20 04:04:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mii_mutex_of_ipg_nic_private [2022-07-20 04:04:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:04:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:04:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure pci_iounmap [2022-07-20 04:04:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_iounmap [2022-07-20 04:04:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure dma_alloc_attrs [2022-07-20 04:04:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_alloc_attrs [2022-07-20 04:04:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2022-07-20 04:04:56,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 04:04:56,142 INFO L130 BoogieDeclarations]: Found specification of procedure ipg_nic_rx_check_error [2022-07-20 04:04:56,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ipg_nic_rx_check_error [2022-07-20 04:04:56,782 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 04:04:56,784 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 04:04:57,732 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 04:04:59,345 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 04:04:59,359 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 04:04:59,360 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-20 04:04:59,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:04:59 BoogieIcfgContainer [2022-07-20 04:04:59,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 04:04:59,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 04:04:59,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 04:04:59,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 04:04:59,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 04:04:52" (1/3) ... [2022-07-20 04:04:59,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a13ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:04:59, skipping insertion in model container [2022-07-20 04:04:59,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:04:55" (2/3) ... [2022-07-20 04:04:59,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a13ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:04:59, skipping insertion in model container [2022-07-20 04:04:59,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:04:59" (3/3) ... [2022-07-20 04:04:59,369 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i [2022-07-20 04:04:59,379 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 04:04:59,380 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-07-20 04:04:59,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 04:04:59,493 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@1c3b7f04, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b32d3d0 [2022-07-20 04:04:59,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-07-20 04:04:59,502 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-20 04:04:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-20 04:04:59,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:04:59,513 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-20 04:04:59,513 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-20 04:04:59,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:04:59,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1162119722, now seen corresponding path program 1 times [2022-07-20 04:04:59,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:04:59,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020279547] [2022-07-20 04:04:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:04:59,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:04:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:59,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:00,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:00,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:00,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:05:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:00,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:05:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:00,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:05:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:00,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:00,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:05:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:00,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:05:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:00,084 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-20 04:05:00,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:00,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020279547] [2022-07-20 04:05:00,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020279547] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:05:00,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:05:00,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:05:00,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842550914] [2022-07-20 04:05:00,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:05:00,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:05:00,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:00,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:05:00,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:05:00,112 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-20 04:05:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:05:04,368 INFO L93 Difference]: Finished difference Result 3773 states and 5399 transitions. [2022-07-20 04:05:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:05:04,386 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-20 04:05:04,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:05:04,414 INFO L225 Difference]: With dead ends: 3773 [2022-07-20 04:05:04,414 INFO L226 Difference]: Without dead ends: 1882 [2022-07-20 04:05:04,433 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-20 04:05:04,435 INFO L413 NwaCegarLoop]: 2206 mSDtfsCounter, 4220 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 2120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4360 SdHoareTripleChecker+Valid, 3440 SdHoareTripleChecker+Invalid, 4724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2120 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:05:04,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4360 Valid, 3440 Invalid, 4724 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2120 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-20 04:05:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-07-20 04:05:04,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1882. [2022-07-20 04:05:04,557 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-20 04:05:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2495 transitions. [2022-07-20 04:05:04,570 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2495 transitions. Word has length 64 [2022-07-20 04:05:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:05:04,571 INFO L495 AbstractCegarLoop]: Abstraction has 1882 states and 2495 transitions. [2022-07-20 04:05:04,572 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-20 04:05:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2495 transitions. [2022-07-20 04:05:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-20 04:05:04,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:05:04,581 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-20 04:05:04,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 04:05:04,582 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-20 04:05:04,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:05:04,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1567625636, now seen corresponding path program 1 times [2022-07-20 04:05:04,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:05:04,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794785478] [2022-07-20 04:05:04,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:04,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:05:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:04,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:04,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:04,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:04,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:05:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:04,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:05:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:04,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:05:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:04,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:04,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:05:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:04,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:05:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:04,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:05:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:04,884 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-20 04:05:04,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:04,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794785478] [2022-07-20 04:05:04,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794785478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:05:04,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:05:04,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:05:04,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009113415] [2022-07-20 04:05:04,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:05:04,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:05:04,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:04,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:05:04,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:05:04,887 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-20 04:05:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:05:08,709 INFO L93 Difference]: Finished difference Result 1882 states and 2495 transitions. [2022-07-20 04:05:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:05:08,710 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-20 04:05:08,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:05:08,721 INFO L225 Difference]: With dead ends: 1882 [2022-07-20 04:05:08,721 INFO L226 Difference]: Without dead ends: 1880 [2022-07-20 04:05:08,723 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-20 04:05:08,726 INFO L413 NwaCegarLoop]: 2188 mSDtfsCounter, 4188 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s 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.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:05:08,726 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.6s Time] [2022-07-20 04:05:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2022-07-20 04:05:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1880. [2022-07-20 04:05:08,790 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-20 04:05:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2493 transitions. [2022-07-20 04:05:08,800 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2493 transitions. Word has length 70 [2022-07-20 04:05:08,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:05:08,802 INFO L495 AbstractCegarLoop]: Abstraction has 1880 states and 2493 transitions. [2022-07-20 04:05:08,803 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-20 04:05:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2493 transitions. [2022-07-20 04:05:08,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-20 04:05:08,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:05:08,809 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-20 04:05:08,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 04:05:08,809 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-20 04:05:08,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:05:08,810 INFO L85 PathProgramCache]: Analyzing trace with hash 287456320, now seen corresponding path program 1 times [2022-07-20 04:05:08,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:05:08,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822846485] [2022-07-20 04:05:08,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:08,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:05:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:08,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:08,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:08,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:08,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:05:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:08,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:05:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:08,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:05:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:09,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:09,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:05:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:09,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:05:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:09,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:05:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:09,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:05:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:09,053 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-20 04:05:09,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:09,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822846485] [2022-07-20 04:05:09,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822846485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:05:09,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:05:09,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:05:09,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989617853] [2022-07-20 04:05:09,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:05:09,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:05:09,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:09,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:05:09,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:05:09,056 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-20 04:05:12,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:05:12,591 INFO L93 Difference]: Finished difference Result 1880 states and 2493 transitions. [2022-07-20 04:05:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:05:12,592 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-20 04:05:12,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:05:12,599 INFO L225 Difference]: With dead ends: 1880 [2022-07-20 04:05:12,599 INFO L226 Difference]: Without dead ends: 1878 [2022-07-20 04:05:12,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:05:12,600 INFO L413 NwaCegarLoop]: 2186 mSDtfsCounter, 4182 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2588 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4318 SdHoareTripleChecker+Valid, 3404 SdHoareTripleChecker+Invalid, 4700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:05:12,601 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.4s Time] [2022-07-20 04:05:12,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2022-07-20 04:05:12,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1878. [2022-07-20 04:05:12,642 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-20 04:05:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2491 transitions. [2022-07-20 04:05:12,649 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2491 transitions. Word has length 76 [2022-07-20 04:05:12,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:05:12,650 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 2491 transitions. [2022-07-20 04:05:12,650 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-20 04:05:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2491 transitions. [2022-07-20 04:05:12,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-20 04:05:12,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:05:12,652 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-20 04:05:12,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 04:05:12,652 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-20 04:05:12,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:05:12,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1590539557, now seen corresponding path program 1 times [2022-07-20 04:05:12,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:05:12,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566168836] [2022-07-20 04:05:12,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:12,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:05:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:12,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:12,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:12,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:12,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:05:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:12,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:05:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:12,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:05:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:12,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:12,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:05:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:12,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:05:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:12,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:05:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:12,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:05:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:12,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:05:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:12,857 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-20 04:05:12,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:12,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566168836] [2022-07-20 04:05:12,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566168836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:05:12,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:05:12,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:05:12,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776726706] [2022-07-20 04:05:12,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:05:12,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:05:12,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:12,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:05:12,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:05:12,860 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-20 04:05:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:05:16,332 INFO L93 Difference]: Finished difference Result 1878 states and 2491 transitions. [2022-07-20 04:05:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:05:16,333 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-20 04:05:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:05:16,341 INFO L225 Difference]: With dead ends: 1878 [2022-07-20 04:05:16,341 INFO L226 Difference]: Without dead ends: 1876 [2022-07-20 04:05:16,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:05:16,343 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:05:16,343 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.3s Time] [2022-07-20 04:05:16,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2022-07-20 04:05:16,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1876. [2022-07-20 04:05:16,389 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-20 04:05:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2489 transitions. [2022-07-20 04:05:16,397 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2489 transitions. Word has length 82 [2022-07-20 04:05:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:05:16,397 INFO L495 AbstractCegarLoop]: Abstraction has 1876 states and 2489 transitions. [2022-07-20 04:05:16,398 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-20 04:05:16,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2489 transitions. [2022-07-20 04:05:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-20 04:05:16,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:05:16,399 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-20 04:05:16,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 04:05:16,399 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-20 04:05:16,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:05:16,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1066774035, now seen corresponding path program 1 times [2022-07-20 04:05:16,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:05:16,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861629726] [2022-07-20 04:05:16,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:16,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:05:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:16,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:16,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:16,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:16,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:05:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:16,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:05:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:16,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:05:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:16,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:16,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:05:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:16,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:05:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:16,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:05:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:16,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:05:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:16,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:05:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:16,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:05:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:16,603 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-20 04:05:16,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:16,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861629726] [2022-07-20 04:05:16,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861629726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:05:16,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:05:16,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:05:16,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93992563] [2022-07-20 04:05:16,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:05:16,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:05:16,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:16,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:05:16,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:05:16,606 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-20 04:05:20,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:05:20,183 INFO L93 Difference]: Finished difference Result 1876 states and 2489 transitions. [2022-07-20 04:05:20,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:05:20,184 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-20 04:05:20,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:05:20,193 INFO L225 Difference]: With dead ends: 1876 [2022-07-20 04:05:20,193 INFO L226 Difference]: Without dead ends: 1874 [2022-07-20 04:05:20,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:05:20,195 INFO L413 NwaCegarLoop]: 2182 mSDtfsCounter, 4170 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2584 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:05:20,195 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.4s Time] [2022-07-20 04:05:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2022-07-20 04:05:20,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1874. [2022-07-20 04:05:20,242 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-20 04:05:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2487 transitions. [2022-07-20 04:05:20,248 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2487 transitions. Word has length 88 [2022-07-20 04:05:20,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:05:20,249 INFO L495 AbstractCegarLoop]: Abstraction has 1874 states and 2487 transitions. [2022-07-20 04:05:20,249 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-20 04:05:20,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2487 transitions. [2022-07-20 04:05:20,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-20 04:05:20,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:05:20,250 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-20 04:05:20,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 04:05:20,250 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-20 04:05:20,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:05:20,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1702010873, now seen corresponding path program 1 times [2022-07-20 04:05:20,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:05:20,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927191297] [2022-07-20 04:05:20,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:20,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:05:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:05:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:05:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:05:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:05:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:05:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:05:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:05:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:05:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:05:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:05:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:05:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:05:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:20,465 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-20 04:05:20,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:20,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927191297] [2022-07-20 04:05:20,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927191297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:05:20,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:05:20,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:05:20,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237709587] [2022-07-20 04:05:20,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:05:20,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:05:20,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:20,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:05:20,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:05:20,467 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-20 04:05:26,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:05:26,084 INFO L93 Difference]: Finished difference Result 5136 states and 6865 transitions. [2022-07-20 04:05:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 04:05:26,085 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-20 04:05:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:05:26,098 INFO L225 Difference]: With dead ends: 5136 [2022-07-20 04:05:26,098 INFO L226 Difference]: Without dead ends: 3283 [2022-07-20 04:05:26,104 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-20 04:05:26,106 INFO L413 NwaCegarLoop]: 2888 mSDtfsCounter, 6442 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 3921 mSolverCounterSat, 4032 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6590 SdHoareTripleChecker+Valid, 4486 SdHoareTripleChecker+Invalid, 7953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4032 IncrementalHoareTripleChecker+Valid, 3921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:05:26,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6590 Valid, 4486 Invalid, 7953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4032 Valid, 3921 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-20 04:05:26,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2022-07-20 04:05:26,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 3122. [2022-07-20 04:05:26,211 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-20 04:05:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 4170 transitions. [2022-07-20 04:05:26,222 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 4170 transitions. Word has length 111 [2022-07-20 04:05:26,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:05:26,223 INFO L495 AbstractCegarLoop]: Abstraction has 3122 states and 4170 transitions. [2022-07-20 04:05:26,223 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-20 04:05:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 4170 transitions. [2022-07-20 04:05:26,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-20 04:05:26,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:05:26,224 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-20 04:05:26,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 04:05:26,224 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-20 04:05:26,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:05:26,225 INFO L85 PathProgramCache]: Analyzing trace with hash -249621299, now seen corresponding path program 1 times [2022-07-20 04:05:26,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:05:26,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731728372] [2022-07-20 04:05:26,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:26,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:05:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:26,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:26,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:26,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:26,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:05:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:26,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:05:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:26,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:05:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:26,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:26,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:05:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:26,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:05:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:26,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:05:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:26,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:05:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:26,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:05:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:26,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:05:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:26,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:05:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:26,416 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-20 04:05:26,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:26,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731728372] [2022-07-20 04:05:26,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731728372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:05:26,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:05:26,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:05:26,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654974878] [2022-07-20 04:05:26,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:05:26,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:05:26,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:26,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:05:26,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:05:26,418 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-20 04:05:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:05:29,885 INFO L93 Difference]: Finished difference Result 3122 states and 4170 transitions. [2022-07-20 04:05:29,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:05:29,894 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-20 04:05:29,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:05:29,907 INFO L225 Difference]: With dead ends: 3122 [2022-07-20 04:05:29,907 INFO L226 Difference]: Without dead ends: 3120 [2022-07-20 04:05:29,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:05:29,910 INFO L413 NwaCegarLoop]: 2180 mSDtfsCounter, 4164 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4297 SdHoareTripleChecker+Valid, 3398 SdHoareTripleChecker+Invalid, 4694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:05:29,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4297 Valid, 3398 Invalid, 4694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2582 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-20 04:05:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2022-07-20 04:05:30,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 3120. [2022-07-20 04:05:30,013 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-20 04:05:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 4168 transitions. [2022-07-20 04:05:30,025 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 4168 transitions. Word has length 94 [2022-07-20 04:05:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:05:30,026 INFO L495 AbstractCegarLoop]: Abstraction has 3120 states and 4168 transitions. [2022-07-20 04:05:30,026 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-20 04:05:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 4168 transitions. [2022-07-20 04:05:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-20 04:05:30,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:05:30,028 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-20 04:05:30,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 04:05:30,028 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-20 04:05:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:05:30,029 INFO L85 PathProgramCache]: Analyzing trace with hash 333765064, now seen corresponding path program 1 times [2022-07-20 04:05:30,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:05:30,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556228532] [2022-07-20 04:05:30,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:30,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:05:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:05:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:05:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:05:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:05:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:05:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:05:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:05:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:05:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:05:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:05:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:05:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:05:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:05:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,271 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-20 04:05:30,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:30,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556228532] [2022-07-20 04:05:30,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556228532] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:05:30,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110012469] [2022-07-20 04:05:30,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:30,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:05:30,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:05:30,274 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:05:30,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 04:05:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:30,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 1917 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 04:05:30,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:05:30,984 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-20 04:05:30,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:05:30,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110012469] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:05:30,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:05:30,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-20 04:05:30,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543389456] [2022-07-20 04:05:30,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:05:30,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 04:05:30,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:30,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 04:05:30,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:05:30,986 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-20 04:05:31,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:05:31,101 INFO L93 Difference]: Finished difference Result 6215 states and 8301 transitions. [2022-07-20 04:05:31,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 04:05:31,102 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-20 04:05:31,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:05:31,116 INFO L225 Difference]: With dead ends: 6215 [2022-07-20 04:05:31,116 INFO L226 Difference]: Without dead ends: 3116 [2022-07-20 04:05:31,127 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-20 04:05:31,127 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-20 04:05:31,127 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-20 04:05:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2022-07-20 04:05:31,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 3116. [2022-07-20 04:05:31,227 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-20 04:05:31,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 4163 transitions. [2022-07-20 04:05:31,237 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 4163 transitions. Word has length 117 [2022-07-20 04:05:31,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:05:31,237 INFO L495 AbstractCegarLoop]: Abstraction has 3116 states and 4163 transitions. [2022-07-20 04:05:31,237 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-20 04:05:31,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 4163 transitions. [2022-07-20 04:05:31,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-20 04:05:31,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:05:31,239 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-20 04:05:31,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 04:05:31,460 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-20 04:05:31,460 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-20 04:05:31,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:05:31,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1509829772, now seen corresponding path program 1 times [2022-07-20 04:05:31,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:05:31,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704182637] [2022-07-20 04:05:31,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:31,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:05:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:31,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:31,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:31,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:31,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:05:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:31,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:05:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:31,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:05:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:31,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:31,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:05:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:31,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:05:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:31,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:05:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:31,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:05:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:31,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:05:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:31,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:05:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:31,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:05:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:31,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:05:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:31,668 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-20 04:05:31,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:31,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704182637] [2022-07-20 04:05:31,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704182637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:05:31,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:05:31,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:05:31,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618693483] [2022-07-20 04:05:31,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:05:31,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:05:31,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:31,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:05:31,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:05:31,671 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-20 04:05:35,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:05:35,162 INFO L93 Difference]: Finished difference Result 3116 states and 4163 transitions. [2022-07-20 04:05:35,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:05:35,171 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-20 04:05:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:05:35,184 INFO L225 Difference]: With dead ends: 3116 [2022-07-20 04:05:35,184 INFO L226 Difference]: Without dead ends: 3114 [2022-07-20 04:05:35,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:05:35,188 INFO L413 NwaCegarLoop]: 2173 mSDtfsCounter, 4153 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2579 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:05:35,188 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.3s Time] [2022-07-20 04:05:35,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2022-07-20 04:05:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3114. [2022-07-20 04:05:35,302 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-20 04:05:35,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 4161 transitions. [2022-07-20 04:05:35,312 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 4161 transitions. Word has length 100 [2022-07-20 04:05:35,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:05:35,312 INFO L495 AbstractCegarLoop]: Abstraction has 3114 states and 4161 transitions. [2022-07-20 04:05:35,312 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-20 04:05:35,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 4161 transitions. [2022-07-20 04:05:35,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-20 04:05:35,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:05:35,315 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:05:35,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 04:05:35,316 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-20 04:05:35,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:05:35,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1795905648, now seen corresponding path program 1 times [2022-07-20 04:05:35,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:05:35,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891366065] [2022-07-20 04:05:35,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:35,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:05:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:35,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:35,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:35,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:35,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:05:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:35,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:05:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:35,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:05:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:35,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:35,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:05:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:35,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:05:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:35,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:05:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:35,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:05:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:35,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:05:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:35,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:05:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:35,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:05:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:35,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:05:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:35,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:05:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:35,533 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-20 04:05:35,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:35,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891366065] [2022-07-20 04:05:35,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891366065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:05:35,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:05:35,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:05:35,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538318165] [2022-07-20 04:05:35,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:05:35,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:05:35,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:35,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:05:35,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:05:35,535 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-20 04:05:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:05:39,025 INFO L93 Difference]: Finished difference Result 3114 states and 4161 transitions. [2022-07-20 04:05:39,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:05:39,025 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-20 04:05:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:05:39,036 INFO L225 Difference]: With dead ends: 3114 [2022-07-20 04:05:39,036 INFO L226 Difference]: Without dead ends: 3112 [2022-07-20 04:05:39,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:05:39,038 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:05:39,038 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.3s Time] [2022-07-20 04:05:39,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2022-07-20 04:05:39,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 3112. [2022-07-20 04:05:39,131 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-20 04:05:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4159 transitions. [2022-07-20 04:05:39,140 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4159 transitions. Word has length 106 [2022-07-20 04:05:39,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:05:39,141 INFO L495 AbstractCegarLoop]: Abstraction has 3112 states and 4159 transitions. [2022-07-20 04:05:39,141 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-20 04:05:39,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4159 transitions. [2022-07-20 04:05:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-20 04:05:39,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:05:39,142 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-20 04:05:39,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 04:05:39,142 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-20 04:05:39,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:05:39,143 INFO L85 PathProgramCache]: Analyzing trace with hash -711355629, now seen corresponding path program 1 times [2022-07-20 04:05:39,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:05:39,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494721085] [2022-07-20 04:05:39,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:39,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:05:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:39,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:39,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:39,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:39,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:05:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:39,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:05:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:39,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:05:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:39,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:39,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:05:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:39,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:05:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:39,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:05:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:39,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:05:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:05:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:39,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:05:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:39,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:05:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:39,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:05:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:39,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:05:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:39,337 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-20 04:05:39,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:39,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494721085] [2022-07-20 04:05:39,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494721085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:05:39,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:05:39,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:05:39,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793221306] [2022-07-20 04:05:39,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:05:39,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:05:39,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:39,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:05:39,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:05:39,339 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-20 04:05:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:05:42,876 INFO L93 Difference]: Finished difference Result 3112 states and 4159 transitions. [2022-07-20 04:05:42,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:05:42,876 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-20 04:05:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:05:42,889 INFO L225 Difference]: With dead ends: 3112 [2022-07-20 04:05:42,889 INFO L226 Difference]: Without dead ends: 3110 [2022-07-20 04:05:42,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:05:42,892 INFO L413 NwaCegarLoop]: 2169 mSDtfsCounter, 4139 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:05:42,892 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.3s Time] [2022-07-20 04:05:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2022-07-20 04:05:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 3110. [2022-07-20 04:05:42,990 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-20 04:05:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 4157 transitions. [2022-07-20 04:05:43,000 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 4157 transitions. Word has length 108 [2022-07-20 04:05:43,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:05:43,001 INFO L495 AbstractCegarLoop]: Abstraction has 3110 states and 4157 transitions. [2022-07-20 04:05:43,001 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-20 04:05:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 4157 transitions. [2022-07-20 04:05:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-20 04:05:43,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:05:43,002 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-20 04:05:43,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 04:05:43,003 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-20 04:05:43,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:05:43,003 INFO L85 PathProgramCache]: Analyzing trace with hash -372751528, now seen corresponding path program 1 times [2022-07-20 04:05:43,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:05:43,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513151272] [2022-07-20 04:05:43,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:43,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:05:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:05:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:05:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:05:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:05:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:05:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:05:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:05:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:05:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:05:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:05:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:05:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:05:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:05:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:43,254 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-20 04:05:43,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:43,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513151272] [2022-07-20 04:05:43,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513151272] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:05:43,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:05:43,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:05:43,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928588924] [2022-07-20 04:05:43,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:05:43,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:05:43,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:43,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:05:43,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:05:43,256 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-20 04:05:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:05:46,792 INFO L93 Difference]: Finished difference Result 3110 states and 4157 transitions. [2022-07-20 04:05:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:05:46,792 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-20 04:05:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:05:46,807 INFO L225 Difference]: With dead ends: 3110 [2022-07-20 04:05:46,807 INFO L226 Difference]: Without dead ends: 3108 [2022-07-20 04:05:46,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:05:46,811 INFO L413 NwaCegarLoop]: 2167 mSDtfsCounter, 4135 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2573 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4265 SdHoareTripleChecker+Valid, 3371 SdHoareTripleChecker+Invalid, 4685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:05:46,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4265 Valid, 3371 Invalid, 4685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2573 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-20 04:05:46,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2022-07-20 04:05:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 3108. [2022-07-20 04:05:46,968 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-20 04:05:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 4155 transitions. [2022-07-20 04:05:46,980 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 4155 transitions. Word has length 114 [2022-07-20 04:05:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:05:46,980 INFO L495 AbstractCegarLoop]: Abstraction has 3108 states and 4155 transitions. [2022-07-20 04:05:46,980 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-20 04:05:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 4155 transitions. [2022-07-20 04:05:46,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-20 04:05:46,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:05:46,982 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-20 04:05:46,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 04:05:46,982 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-20 04:05:46,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:05:46,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1629281415, now seen corresponding path program 1 times [2022-07-20 04:05:46,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:05:46,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089410395] [2022-07-20 04:05:46,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:46,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:05:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:05:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:05:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:05:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:05:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:05:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:05:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:05:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:05:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:05:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:05:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:05:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:05:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:05:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:05:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:47,208 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-20 04:05:47,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:47,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089410395] [2022-07-20 04:05:47,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089410395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:05:47,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:05:47,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:05:47,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046484931] [2022-07-20 04:05:47,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:05:47,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:05:47,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:47,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:05:47,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:05:47,211 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-20 04:05:51,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:05:51,026 INFO L93 Difference]: Finished difference Result 3108 states and 4155 transitions. [2022-07-20 04:05:51,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:05:51,026 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-20 04:05:51,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:05:51,035 INFO L225 Difference]: With dead ends: 3108 [2022-07-20 04:05:51,036 INFO L226 Difference]: Without dead ends: 3106 [2022-07-20 04:05:51,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:05:51,037 INFO L413 NwaCegarLoop]: 2165 mSDtfsCounter, 4129 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s 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.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:05:51,037 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.6s Time] [2022-07-20 04:05:51,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2022-07-20 04:05:51,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3106. [2022-07-20 04:05:51,147 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-20 04:05:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 4153 transitions. [2022-07-20 04:05:51,157 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 4153 transitions. Word has length 120 [2022-07-20 04:05:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:05:51,158 INFO L495 AbstractCegarLoop]: Abstraction has 3106 states and 4153 transitions. [2022-07-20 04:05:51,158 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-20 04:05:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 4153 transitions. [2022-07-20 04:05:51,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-20 04:05:51,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:05:51,159 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-20 04:05:51,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 04:05:51,160 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-20 04:05:51,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:05:51,160 INFO L85 PathProgramCache]: Analyzing trace with hash 408849737, now seen corresponding path program 1 times [2022-07-20 04:05:51,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:05:51,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569064781] [2022-07-20 04:05:51,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:51,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:05:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:05:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:05:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:05:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:05:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:05:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:05:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:05:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:05:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:05:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:05:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:05:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:05:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:05:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:05:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:05:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:51,361 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-20 04:05:51,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:51,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569064781] [2022-07-20 04:05:51,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569064781] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:05:51,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:05:51,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:05:51,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66320058] [2022-07-20 04:05:51,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:05:51,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:05:51,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:51,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:05:51,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:05:51,364 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-20 04:05:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:05:55,081 INFO L93 Difference]: Finished difference Result 3106 states and 4153 transitions. [2022-07-20 04:05:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:05:55,081 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-20 04:05:55,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:05:55,092 INFO L225 Difference]: With dead ends: 3106 [2022-07-20 04:05:55,092 INFO L226 Difference]: Without dead ends: 3104 [2022-07-20 04:05:55,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:05:55,094 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:05:55,096 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.5s Time] [2022-07-20 04:05:55,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3104 states. [2022-07-20 04:05:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3104 to 3104. [2022-07-20 04:05:55,200 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-20 04:05:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 4151 transitions. [2022-07-20 04:05:55,209 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 4151 transitions. Word has length 126 [2022-07-20 04:05:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:05:55,210 INFO L495 AbstractCegarLoop]: Abstraction has 3104 states and 4151 transitions. [2022-07-20 04:05:55,210 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-20 04:05:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 4151 transitions. [2022-07-20 04:05:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-20 04:05:55,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:05:55,215 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-20 04:05:55,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 04:05:55,215 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-20 04:05:55,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:05:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash -753274789, now seen corresponding path program 1 times [2022-07-20 04:05:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:05:55,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30159860] [2022-07-20 04:05:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:05:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:05:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:05:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:05:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:05:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:05:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:05:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:05:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:05:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:05:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:05:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:05:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:05:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:05:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:05:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:05:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:05:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:05:55,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:55,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30159860] [2022-07-20 04:05:55,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30159860] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:05:55,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:05:55,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:05:55,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413529357] [2022-07-20 04:05:55,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:05:55,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:05:55,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:55,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:05:55,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:05:55,410 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-20 04:05:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:05:58,914 INFO L93 Difference]: Finished difference Result 3104 states and 4151 transitions. [2022-07-20 04:05:58,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:05:58,914 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-20 04:05:58,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:05:58,926 INFO L225 Difference]: With dead ends: 3104 [2022-07-20 04:05:58,926 INFO L226 Difference]: Without dead ends: 3102 [2022-07-20 04:05:58,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:05:58,929 INFO L413 NwaCegarLoop]: 2161 mSDtfsCounter, 4117 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4244 SdHoareTripleChecker+Valid, 3365 SdHoareTripleChecker+Invalid, 4679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:05:58,929 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.3s Time] [2022-07-20 04:05:58,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2022-07-20 04:05:59,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 3102. [2022-07-20 04:05:59,045 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-20 04:05:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 4149 transitions. [2022-07-20 04:05:59,056 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 4149 transitions. Word has length 132 [2022-07-20 04:05:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:05:59,056 INFO L495 AbstractCegarLoop]: Abstraction has 3102 states and 4149 transitions. [2022-07-20 04:05:59,057 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-20 04:05:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 4149 transitions. [2022-07-20 04:05:59,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-20 04:05:59,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:05:59,058 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-20 04:05:59,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 04:05:59,059 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-20 04:05:59,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:05:59,059 INFO L85 PathProgramCache]: Analyzing trace with hash -499223925, now seen corresponding path program 1 times [2022-07-20 04:05:59,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:05:59,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147384919] [2022-07-20 04:05:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:59,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:05:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:05:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:05:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:05:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:05:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:05:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:05:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:05:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:05:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:05:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:05:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:05:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:05:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:05:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:05:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:05:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:05:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:05:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:59,320 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-20 04:05:59,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:59,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147384919] [2022-07-20 04:05:59,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147384919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:05:59,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:05:59,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:05:59,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83475444] [2022-07-20 04:05:59,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:05:59,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:05:59,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:59,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:05:59,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:05:59,323 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-20 04:06:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:06:02,961 INFO L93 Difference]: Finished difference Result 3102 states and 4149 transitions. [2022-07-20 04:06:02,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:06:02,961 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-20 04:06:02,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:06:02,969 INFO L225 Difference]: With dead ends: 3102 [2022-07-20 04:06:02,969 INFO L226 Difference]: Without dead ends: 3100 [2022-07-20 04:06:02,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:06:02,970 INFO L413 NwaCegarLoop]: 2159 mSDtfsCounter, 4111 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2565 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:06:02,971 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.4s Time] [2022-07-20 04:06:02,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2022-07-20 04:06:03,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3100. [2022-07-20 04:06:03,114 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-20 04:06:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4147 transitions. [2022-07-20 04:06:03,123 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4147 transitions. Word has length 138 [2022-07-20 04:06:03,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:06:03,124 INFO L495 AbstractCegarLoop]: Abstraction has 3100 states and 4147 transitions. [2022-07-20 04:06:03,124 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-20 04:06:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4147 transitions. [2022-07-20 04:06:03,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-20 04:06:03,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:06:03,127 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-20 04:06:03,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 04:06:03,127 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-20 04:06:03,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:06:03,127 INFO L85 PathProgramCache]: Analyzing trace with hash -867666618, now seen corresponding path program 1 times [2022-07-20 04:06:03,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:06:03,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127299213] [2022-07-20 04:06:03,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:06:03,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:06:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:06:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:06:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:06:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:06:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:06:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:06:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:06:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:06:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:06:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:06:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:06:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:06:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:06:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:06:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:06:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:06:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:06:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:06:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:06:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:06:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:06:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:03,344 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-20 04:06:03,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:06:03,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127299213] [2022-07-20 04:06:03,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127299213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:06:03,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:06:03,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:06:03,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601975401] [2022-07-20 04:06:03,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:06:03,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:06:03,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:06:03,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:06:03,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:06:03,346 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-20 04:06:07,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:06:07,011 INFO L93 Difference]: Finished difference Result 3100 states and 4147 transitions. [2022-07-20 04:06:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:06:07,011 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-20 04:06:07,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:06:07,018 INFO L225 Difference]: With dead ends: 3100 [2022-07-20 04:06:07,018 INFO L226 Difference]: Without dead ends: 3098 [2022-07-20 04:06:07,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:06:07,019 INFO L413 NwaCegarLoop]: 2157 mSDtfsCounter, 4105 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2563 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4230 SdHoareTripleChecker+Valid, 3361 SdHoareTripleChecker+Invalid, 4675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:06:07,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4230 Valid, 3361 Invalid, 4675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2563 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-20 04:06:07,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2022-07-20 04:06:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 3098. [2022-07-20 04:06:07,127 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-20 04:06:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4145 transitions. [2022-07-20 04:06:07,136 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4145 transitions. Word has length 144 [2022-07-20 04:06:07,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:06:07,136 INFO L495 AbstractCegarLoop]: Abstraction has 3098 states and 4145 transitions. [2022-07-20 04:06:07,137 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-20 04:06:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4145 transitions. [2022-07-20 04:06:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-20 04:06:07,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:06:07,139 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-20 04:06:07,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 04:06:07,139 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-20 04:06:07,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:06:07,139 INFO L85 PathProgramCache]: Analyzing trace with hash -312577598, now seen corresponding path program 1 times [2022-07-20 04:06:07,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:06:07,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343491155] [2022-07-20 04:06:07,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:06:07,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:06:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:06:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:06:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:06:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:06:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:06:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:06:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:06:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:06:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:06:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:06:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:06:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:06:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:06:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:06:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:06:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:06:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:06:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:06:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:06:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:06:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:06:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:06:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,343 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-20 04:06:07,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:06:07,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343491155] [2022-07-20 04:06:07,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343491155] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:06:07,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:06:07,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:06:07,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143258824] [2022-07-20 04:06:07,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:06:07,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:06:07,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:06:07,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:06:07,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:06:07,346 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-20 04:06:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:06:10,692 INFO L93 Difference]: Finished difference Result 3098 states and 4145 transitions. [2022-07-20 04:06:10,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:06:10,693 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-20 04:06:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:06:10,703 INFO L225 Difference]: With dead ends: 3098 [2022-07-20 04:06:10,703 INFO L226 Difference]: Without dead ends: 3096 [2022-07-20 04:06:10,705 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-20 04:06:10,706 INFO L413 NwaCegarLoop]: 2155 mSDtfsCounter, 4099 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2561 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4223 SdHoareTripleChecker+Valid, 3359 SdHoareTripleChecker+Invalid, 4673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:06:10,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4223 Valid, 3359 Invalid, 4673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2561 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-20 04:06:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2022-07-20 04:06:10,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 3096. [2022-07-20 04:06:10,836 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-20 04:06:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 4143 transitions. [2022-07-20 04:06:10,848 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 4143 transitions. Word has length 150 [2022-07-20 04:06:10,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:06:10,848 INFO L495 AbstractCegarLoop]: Abstraction has 3096 states and 4143 transitions. [2022-07-20 04:06:10,848 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-20 04:06:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 4143 transitions. [2022-07-20 04:06:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-20 04:06:10,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:06:10,851 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-20 04:06:10,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 04:06:10,851 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-20 04:06:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:06:10,852 INFO L85 PathProgramCache]: Analyzing trace with hash 135128004, now seen corresponding path program 1 times [2022-07-20 04:06:10,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:06:10,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513579903] [2022-07-20 04:06:10,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:06:10,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:06:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:06:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:06:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:06:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:06:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:06:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:06:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:06:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:06:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:11,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:06:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:11,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:06:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:11,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:06:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:11,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:06:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:11,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:06:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:11,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:06:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:11,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:06:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:11,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:06:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:11,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:06:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:11,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:06:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:11,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:06:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:11,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:06:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:11,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:06:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:11,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:06:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:11,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:06:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:11,126 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-20 04:06:11,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:06:11,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513579903] [2022-07-20 04:06:11,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513579903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:06:11,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:06:11,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:06:11,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622374699] [2022-07-20 04:06:11,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:06:11,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:06:11,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:06:11,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:06:11,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:06:11,127 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-20 04:06:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:06:14,735 INFO L93 Difference]: Finished difference Result 3096 states and 4143 transitions. [2022-07-20 04:06:14,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:06:14,735 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-20 04:06:14,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:06:14,745 INFO L225 Difference]: With dead ends: 3096 [2022-07-20 04:06:14,745 INFO L226 Difference]: Without dead ends: 3094 [2022-07-20 04:06:14,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:06:14,748 INFO L413 NwaCegarLoop]: 2153 mSDtfsCounter, 4093 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4216 SdHoareTripleChecker+Valid, 3357 SdHoareTripleChecker+Invalid, 4671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:06:14,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4216 Valid, 3357 Invalid, 4671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-20 04:06:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2022-07-20 04:06:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3094. [2022-07-20 04:06:14,909 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-20 04:06:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 4141 transitions. [2022-07-20 04:06:14,918 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 4141 transitions. Word has length 156 [2022-07-20 04:06:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:06:14,919 INFO L495 AbstractCegarLoop]: Abstraction has 3094 states and 4141 transitions. [2022-07-20 04:06:14,919 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-20 04:06:14,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 4141 transitions. [2022-07-20 04:06:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-20 04:06:14,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:06:14,921 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-20 04:06:14,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 04:06:14,922 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-20 04:06:14,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:06:14,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1099415850, now seen corresponding path program 1 times [2022-07-20 04:06:14,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:06:14,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761736156] [2022-07-20 04:06:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:06:14,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:06:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:06:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:06:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:06:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:06:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:06:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:06:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:06:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:06:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:06:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:06:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:06:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:06:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:06:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:06:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:06:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:06:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:06:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:06:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:06:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:06:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:06:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:06:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:06:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 04:06:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:15,149 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-20 04:06:15,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:06:15,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761736156] [2022-07-20 04:06:15,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761736156] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:06:15,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:06:15,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:06:15,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376383318] [2022-07-20 04:06:15,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:06:15,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:06:15,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:06:15,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:06:15,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:06:15,151 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-20 04:06:17,398 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-20 04:06:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:06:19,812 INFO L93 Difference]: Finished difference Result 3094 states and 4141 transitions. [2022-07-20 04:06:19,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:06:19,813 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-20 04:06:19,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:06:19,820 INFO L225 Difference]: With dead ends: 3094 [2022-07-20 04:06:19,820 INFO L226 Difference]: Without dead ends: 3092 [2022-07-20 04:06:19,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:06:19,822 INFO L413 NwaCegarLoop]: 2151 mSDtfsCounter, 4087 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2557 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4209 SdHoareTripleChecker+Valid, 3355 SdHoareTripleChecker+Invalid, 4669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:06:19,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4209 Valid, 3355 Invalid, 4669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2557 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-20 04:06:19,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2022-07-20 04:06:19,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 3092. [2022-07-20 04:06:19,951 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-20 04:06:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4139 transitions. [2022-07-20 04:06:19,962 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4139 transitions. Word has length 162 [2022-07-20 04:06:19,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:06:19,962 INFO L495 AbstractCegarLoop]: Abstraction has 3092 states and 4139 transitions. [2022-07-20 04:06:19,963 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-20 04:06:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4139 transitions. [2022-07-20 04:06:19,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-07-20 04:06:19,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:06:19,966 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-20 04:06:19,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 04:06:19,966 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-20 04:06:19,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:06:19,967 INFO L85 PathProgramCache]: Analyzing trace with hash -122245697, now seen corresponding path program 1 times [2022-07-20 04:06:19,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:06:19,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681417460] [2022-07-20 04:06:19,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:06:19,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:06:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:06:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:06:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:06:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:06:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:06:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:06:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:06:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:06:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:06:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:06:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:06:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:06:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:06:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:06:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:06:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:06:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 04:06:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-20 04:06:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-20 04:06:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 04:06:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 04:06:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:06:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:06:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-20 04:06:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:20,356 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-20 04:06:20,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:06:20,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681417460] [2022-07-20 04:06:20,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681417460] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:06:20,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:06:20,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 04:06:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430116373] [2022-07-20 04:06:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:06:20,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 04:06:20,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:06:20,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 04:06:20,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 04:06:20,360 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-20 04:06:23,338 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:06:28,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:06:28,206 INFO L93 Difference]: Finished difference Result 3241 states and 4371 transitions. [2022-07-20 04:06:28,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 04:06:28,206 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-20 04:06:28,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:06:28,218 INFO L225 Difference]: With dead ends: 3241 [2022-07-20 04:06:28,218 INFO L226 Difference]: Without dead ends: 3239 [2022-07-20 04:06:28,221 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-20 04:06:28,222 INFO L413 NwaCegarLoop]: 2143 mSDtfsCounter, 5025 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 5368 mSolverCounterSat, 2902 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5149 SdHoareTripleChecker+Valid, 4204 SdHoareTripleChecker+Invalid, 8270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2902 IncrementalHoareTripleChecker+Valid, 5368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:06:28,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5149 Valid, 4204 Invalid, 8270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2902 Valid, 5368 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-07-20 04:06:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2022-07-20 04:06:28,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 3090. [2022-07-20 04:06:28,401 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-20 04:06:28,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 4136 transitions. [2022-07-20 04:06:28,413 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 4136 transitions. Word has length 205 [2022-07-20 04:06:28,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:06:28,413 INFO L495 AbstractCegarLoop]: Abstraction has 3090 states and 4136 transitions. [2022-07-20 04:06:28,413 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-20 04:06:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 4136 transitions. [2022-07-20 04:06:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-20 04:06:28,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:06:28,416 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-20 04:06:28,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 04:06:28,417 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-20 04:06:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:06:28,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1437092455, now seen corresponding path program 1 times [2022-07-20 04:06:28,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:06:28,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960760032] [2022-07-20 04:06:28,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:06:28,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:06:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:06:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:06:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:06:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:06:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:06:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:06:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:06:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:06:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:06:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:06:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:06:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:06:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:06:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:06:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:06:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:06:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:06:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:06:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:06:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:06:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:06:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:06:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:06:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 04:06:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:06:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:28,662 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-20 04:06:28,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:06:28,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960760032] [2022-07-20 04:06:28,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960760032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:06:28,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:06:28,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:06:28,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546309052] [2022-07-20 04:06:28,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:06:28,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:06:28,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:06:28,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:06:28,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:06:28,665 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-20 04:06:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:06:32,853 INFO L93 Difference]: Finished difference Result 3090 states and 4136 transitions. [2022-07-20 04:06:32,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:06:32,854 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-20 04:06:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:06:32,861 INFO L225 Difference]: With dead ends: 3090 [2022-07-20 04:06:32,861 INFO L226 Difference]: Without dead ends: 3088 [2022-07-20 04:06:32,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:06:32,862 INFO L413 NwaCegarLoop]: 2147 mSDtfsCounter, 4075 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2553 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:06:32,862 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.9s Time] [2022-07-20 04:06:32,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2022-07-20 04:06:32,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 3088. [2022-07-20 04:06:32,988 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-20 04:06:32,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 4134 transitions. [2022-07-20 04:06:32,997 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 4134 transitions. Word has length 168 [2022-07-20 04:06:32,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:06:32,997 INFO L495 AbstractCegarLoop]: Abstraction has 3088 states and 4134 transitions. [2022-07-20 04:06:32,997 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-20 04:06:32,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 4134 transitions. [2022-07-20 04:06:33,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-20 04:06:33,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:06:33,000 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-20 04:06:33,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 04:06:33,000 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-20 04:06:33,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:06:33,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1470050927, now seen corresponding path program 1 times [2022-07-20 04:06:33,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:06:33,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128465191] [2022-07-20 04:06:33,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:06:33,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:06:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:06:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:06:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:06:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:06:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:06:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:06:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:06:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:06:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:06:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:06:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:06:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:06:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:06:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:06:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:06:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:06:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:06:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:06:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:06:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:06:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:06:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:06:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:06:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 04:06:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:06:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 04:06:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:33,202 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-20 04:06:33,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:06:33,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128465191] [2022-07-20 04:06:33,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128465191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:06:33,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:06:33,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:06:33,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561519790] [2022-07-20 04:06:33,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:06:33,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:06:33,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:06:33,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:06:33,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:06:33,204 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-20 04:06:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:06:36,596 INFO L93 Difference]: Finished difference Result 3088 states and 4134 transitions. [2022-07-20 04:06:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:06:36,597 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-20 04:06:36,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:06:36,606 INFO L225 Difference]: With dead ends: 3088 [2022-07-20 04:06:36,606 INFO L226 Difference]: Without dead ends: 3086 [2022-07-20 04:06:36,608 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-20 04:06:36,608 INFO L413 NwaCegarLoop]: 2145 mSDtfsCounter, 4069 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4189 SdHoareTripleChecker+Valid, 3349 SdHoareTripleChecker+Invalid, 4663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:06:36,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4189 Valid, 3349 Invalid, 4663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-20 04:06:36,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3086 states. [2022-07-20 04:06:36,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3086 to 3086. [2022-07-20 04:06:36,750 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-20 04:06:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 4132 transitions. [2022-07-20 04:06:36,762 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 4132 transitions. Word has length 174 [2022-07-20 04:06:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:06:36,762 INFO L495 AbstractCegarLoop]: Abstraction has 3086 states and 4132 transitions. [2022-07-20 04:06:36,762 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-20 04:06:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 4132 transitions. [2022-07-20 04:06:36,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-20 04:06:36,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:06:36,766 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-20 04:06:36,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 04:06:36,766 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-20 04:06:36,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:06:36,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1645425594, now seen corresponding path program 1 times [2022-07-20 04:06:36,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:06:36,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115112610] [2022-07-20 04:06:36,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:06:36,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:06:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:36,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:06:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:36,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:06:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:36,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:06:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:36,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:06:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:36,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:06:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:36,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:06:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:36,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:06:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:36,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:36,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:06:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:36,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:06:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:36,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:06:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:06:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:06:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:06:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:06:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:06:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:06:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 04:06:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-20 04:06:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-20 04:06:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 04:06:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 04:06:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-20 04:06:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-20 04:06:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:06:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:06:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 04:06:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 04:06:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:06:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:37,124 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-20 04:06:37,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:06:37,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115112610] [2022-07-20 04:06:37,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115112610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:06:37,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:06:37,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:06:37,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100849924] [2022-07-20 04:06:37,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:06:37,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:06:37,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:06:37,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:06:37,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:06:37,127 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-20 04:06:41,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:06:48,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:06:48,693 INFO L93 Difference]: Finished difference Result 4612 states and 6232 transitions. [2022-07-20 04:06:48,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 04:06:48,694 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-20 04:06:48,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:06:48,705 INFO L225 Difference]: With dead ends: 4612 [2022-07-20 04:06:48,705 INFO L226 Difference]: Without dead ends: 4610 [2022-07-20 04:06:48,706 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-20 04:06:48,707 INFO L413 NwaCegarLoop]: 2305 mSDtfsCounter, 7514 mSDsluCounter, 2415 mSDsCounter, 0 mSdLazyCounter, 7814 mSolverCounterSat, 4740 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7639 SdHoareTripleChecker+Valid, 4720 SdHoareTripleChecker+Invalid, 12555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4740 IncrementalHoareTripleChecker+Valid, 7814 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:06:48,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7639 Valid, 4720 Invalid, 12555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4740 Valid, 7814 Invalid, 1 Unknown, 0 Unchecked, 11.0s Time] [2022-07-20 04:06:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2022-07-20 04:06:48,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 3955. [2022-07-20 04:06:48,913 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-20 04:06:48,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3955 states to 3955 states and 5247 transitions. [2022-07-20 04:06:48,923 INFO L78 Accepts]: Start accepts. Automaton has 3955 states and 5247 transitions. Word has length 211 [2022-07-20 04:06:48,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:06:48,923 INFO L495 AbstractCegarLoop]: Abstraction has 3955 states and 5247 transitions. [2022-07-20 04:06:48,924 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-20 04:06:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 3955 states and 5247 transitions. [2022-07-20 04:06:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-07-20 04:06:48,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:06:48,926 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-20 04:06:48,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 04:06:48,927 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-20 04:06:48,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:06:48,927 INFO L85 PathProgramCache]: Analyzing trace with hash -464471811, now seen corresponding path program 1 times [2022-07-20 04:06:48,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:06:48,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429861922] [2022-07-20 04:06:48,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:06:48,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:06:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:06:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:06:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:06:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:06:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:06:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:06:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:06:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:06:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:06:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:06:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:06:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:06:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:06:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:06:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:06:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:06:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 04:06:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-20 04:06:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-20 04:06:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 04:06:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 04:06:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:06:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:06:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-20 04:06:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-20 04:06:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:49,323 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-20 04:06:49,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:06:49,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429861922] [2022-07-20 04:06:49,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429861922] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:06:49,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:06:49,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:06:49,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933458718] [2022-07-20 04:06:49,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:06:49,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:06:49,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:06:49,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:06:49,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:06:49,325 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-20 04:06:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:06:57,735 INFO L93 Difference]: Finished difference Result 4157 states and 5549 transitions. [2022-07-20 04:06:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 04:06:57,735 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-20 04:06:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:06:57,745 INFO L225 Difference]: With dead ends: 4157 [2022-07-20 04:06:57,745 INFO L226 Difference]: Without dead ends: 4155 [2022-07-20 04:06:57,746 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-20 04:06:57,747 INFO L413 NwaCegarLoop]: 2136 mSDtfsCounter, 4567 mSDsluCounter, 2895 mSDsCounter, 0 mSdLazyCounter, 7453 mSolverCounterSat, 3046 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4567 SdHoareTripleChecker+Valid, 5031 SdHoareTripleChecker+Invalid, 10499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3046 IncrementalHoareTripleChecker+Valid, 7453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:06:57,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4567 Valid, 5031 Invalid, 10499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3046 Valid, 7453 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-07-20 04:06:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2022-07-20 04:06:57,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 3953. [2022-07-20 04:06:57,938 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-20 04:06:57,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 5244 transitions. [2022-07-20 04:06:57,946 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 5244 transitions. Word has length 217 [2022-07-20 04:06:57,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:06:57,946 INFO L495 AbstractCegarLoop]: Abstraction has 3953 states and 5244 transitions. [2022-07-20 04:06:57,947 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-20 04:06:57,947 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 5244 transitions. [2022-07-20 04:06:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-20 04:06:57,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:06:57,949 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-20 04:06:57,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 04:06:57,949 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-20 04:06:57,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:06:57,950 INFO L85 PathProgramCache]: Analyzing trace with hash -965782681, now seen corresponding path program 1 times [2022-07-20 04:06:57,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:06:57,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220787261] [2022-07-20 04:06:57,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:06:57,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:06:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:06:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:06:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:06:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:06:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:06:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:06:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:06:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:06:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:06:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:06:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:06:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:06:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:06:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:06:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:06:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:06:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:06:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:06:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:06:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:06:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:06:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:06:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:06:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 04:06:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:06:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 04:06:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:06:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:58,185 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-20 04:06:58,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:06:58,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220787261] [2022-07-20 04:06:58,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220787261] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:06:58,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:06:58,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:06:58,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166552516] [2022-07-20 04:06:58,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:06:58,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:06:58,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:06:58,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:06:58,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:06:58,187 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-20 04:07:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:01,639 INFO L93 Difference]: Finished difference Result 3953 states and 5244 transitions. [2022-07-20 04:07:01,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:07:01,639 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-20 04:07:01,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:01,648 INFO L225 Difference]: With dead ends: 3953 [2022-07-20 04:07:01,649 INFO L226 Difference]: Without dead ends: 3760 [2022-07-20 04:07:01,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:07:01,651 INFO L413 NwaCegarLoop]: 2140 mSDtfsCounter, 4048 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.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, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:07:01,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4167 Valid, 3344 Invalid, 4659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 2547 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-20 04:07:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2022-07-20 04:07:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 3760. [2022-07-20 04:07:01,862 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-20 04:07:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3760 states and 5012 transitions. [2022-07-20 04:07:01,870 INFO L78 Accepts]: Start accepts. Automaton has 3760 states and 5012 transitions. Word has length 180 [2022-07-20 04:07:01,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:01,870 INFO L495 AbstractCegarLoop]: Abstraction has 3760 states and 5012 transitions. [2022-07-20 04:07:01,871 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-20 04:07:01,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 5012 transitions. [2022-07-20 04:07:01,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-07-20 04:07:01,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:01,873 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-20 04:07:01,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-20 04:07:01,873 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-20 04:07:01,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:01,874 INFO L85 PathProgramCache]: Analyzing trace with hash 862312457, now seen corresponding path program 1 times [2022-07-20 04:07:01,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:01,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599541396] [2022-07-20 04:07:01,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:01,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:01,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:07:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:07:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:07:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:07:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:07:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:07:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:07:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:07:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 04:07:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-20 04:07:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-20 04:07:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 04:07:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 04:07:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:07:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:07:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 04:07:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 04:07:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:07:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-20 04:07:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-20 04:07:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-20 04:07:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:02,245 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-20 04:07:02,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:02,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599541396] [2022-07-20 04:07:02,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599541396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:02,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:07:02,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 04:07:02,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930063718] [2022-07-20 04:07:02,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:02,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 04:07:02,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:02,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 04:07:02,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 04:07:02,247 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-20 04:07:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:09,496 INFO L93 Difference]: Finished difference Result 8820 states and 11982 transitions. [2022-07-20 04:07:09,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 04:07:09,496 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-20 04:07:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:09,522 INFO L225 Difference]: With dead ends: 8820 [2022-07-20 04:07:09,522 INFO L226 Difference]: Without dead ends: 5079 [2022-07-20 04:07:09,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2022-07-20 04:07:09,537 INFO L413 NwaCegarLoop]: 1933 mSDtfsCounter, 5363 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 3800 mSolverCounterSat, 3483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5363 SdHoareTripleChecker+Valid, 3567 SdHoareTripleChecker+Invalid, 7283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3483 IncrementalHoareTripleChecker+Valid, 3800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:07:09,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5363 Valid, 3567 Invalid, 7283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3483 Valid, 3800 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-07-20 04:07:09,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5079 states. [2022-07-20 04:07:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5079 to 3784. [2022-07-20 04:07:09,809 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-20 04:07:09,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5048 transitions. [2022-07-20 04:07:09,818 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5048 transitions. Word has length 227 [2022-07-20 04:07:09,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:09,819 INFO L495 AbstractCegarLoop]: Abstraction has 3784 states and 5048 transitions. [2022-07-20 04:07:09,819 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-20 04:07:09,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5048 transitions. [2022-07-20 04:07:09,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-07-20 04:07:09,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:09,822 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-20 04:07:09,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 04:07:09,822 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-20 04:07:09,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:09,822 INFO L85 PathProgramCache]: Analyzing trace with hash 125964688, now seen corresponding path program 1 times [2022-07-20 04:07:09,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:09,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613216391] [2022-07-20 04:07:09,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:09,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:07:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:07:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:07:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:07:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:07:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:07:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:07:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:09,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:07:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 04:07:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-20 04:07:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-20 04:07:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 04:07:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 04:07:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:07:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:07:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 04:07:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 04:07:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:07:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 04:07:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-20 04:07:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-20 04:07:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-20 04:07:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,125 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-20 04:07:10,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:10,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613216391] [2022-07-20 04:07:10,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613216391] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:07:10,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706529250] [2022-07-20 04:07:10,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:10,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:07:10,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:07:10,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:07:10,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 04:07:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:10,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 2521 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-20 04:07:10,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:07:11,066 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-20 04:07:11,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:07:11,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706529250] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:11,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:07:11,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [9] total 22 [2022-07-20 04:07:11,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396516210] [2022-07-20 04:07:11,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:11,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 04:07:11,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:11,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 04:07:11,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2022-07-20 04:07:11,068 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-20 04:07:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:12,150 INFO L93 Difference]: Finished difference Result 8040 states and 10767 transitions. [2022-07-20 04:07:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 04:07:12,150 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-20 04:07:12,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:12,166 INFO L225 Difference]: With dead ends: 8040 [2022-07-20 04:07:12,166 INFO L226 Difference]: Without dead ends: 4274 [2022-07-20 04:07:12,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2022-07-20 04:07:12,178 INFO L413 NwaCegarLoop]: 2609 mSDtfsCounter, 1381 mSDsluCounter, 32051 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 34660 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:07:12,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 34660 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 04:07:12,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4274 states. [2022-07-20 04:07:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4274 to 3812. [2022-07-20 04:07:12,414 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-20 04:07:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3812 states to 3812 states and 5086 transitions. [2022-07-20 04:07:12,424 INFO L78 Accepts]: Start accepts. Automaton has 3812 states and 5086 transitions. Word has length 239 [2022-07-20 04:07:12,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:12,424 INFO L495 AbstractCegarLoop]: Abstraction has 3812 states and 5086 transitions. [2022-07-20 04:07:12,425 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-20 04:07:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3812 states and 5086 transitions. [2022-07-20 04:07:12,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2022-07-20 04:07:12,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:12,427 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-20 04:07:12,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 04:07:12,643 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-20 04:07:12,643 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-20 04:07:12,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:12,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1053085854, now seen corresponding path program 1 times [2022-07-20 04:07:12,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:12,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860410299] [2022-07-20 04:07:12,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:12,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:07:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:07:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:07:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:07:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:07:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:07:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:07:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:07:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 04:07:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-20 04:07:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-20 04:07:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 04:07:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:07:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 04:07:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-20 04:07:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-20 04:07:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-20 04:07:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:12,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-20 04:07:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-20 04:07:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-20 04:07:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-20 04:07:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-20 04:07:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:07:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 04:07:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 04:07:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:07:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 04:07:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-20 04:07:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-20 04:07:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-07-20 04:07:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:13,092 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-20 04:07:13,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:13,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860410299] [2022-07-20 04:07:13,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860410299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:13,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:07:13,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 04:07:13,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53543900] [2022-07-20 04:07:13,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:13,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 04:07:13,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:13,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 04:07:13,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:07:13,095 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-20 04:07:22,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:07:25,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:25,641 INFO L93 Difference]: Finished difference Result 8328 states and 11225 transitions. [2022-07-20 04:07:25,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 04:07:25,641 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-20 04:07:25,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:25,658 INFO L225 Difference]: With dead ends: 8328 [2022-07-20 04:07:25,658 INFO L226 Difference]: Without dead ends: 4535 [2022-07-20 04:07:25,670 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-20 04:07:25,674 INFO L413 NwaCegarLoop]: 1981 mSDtfsCounter, 5513 mSDsluCounter, 2607 mSDsCounter, 0 mSdLazyCounter, 7571 mSolverCounterSat, 3983 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5515 SdHoareTripleChecker+Valid, 4588 SdHoareTripleChecker+Invalid, 11554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3983 IncrementalHoareTripleChecker+Valid, 7571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:07:25,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5515 Valid, 4588 Invalid, 11554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3983 Valid, 7571 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2022-07-20 04:07:25,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2022-07-20 04:07:25,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 3815. [2022-07-20 04:07:25,961 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-20 04:07:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 5089 transitions. [2022-07-20 04:07:25,972 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 5089 transitions. Word has length 304 [2022-07-20 04:07:25,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:25,972 INFO L495 AbstractCegarLoop]: Abstraction has 3815 states and 5089 transitions. [2022-07-20 04:07:25,972 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-20 04:07:25,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 5089 transitions. [2022-07-20 04:07:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-07-20 04:07:25,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:25,976 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-20 04:07:25,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-20 04:07:25,976 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-20 04:07:25,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:25,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1459983746, now seen corresponding path program 1 times [2022-07-20 04:07:25,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:25,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323631091] [2022-07-20 04:07:25,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:25,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:07:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:07:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:07:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:07:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:07:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:07:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:07:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:07:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 04:07:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-20 04:07:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-20 04:07:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 04:07:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:07:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-20 04:07:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-20 04:07:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 04:07:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-20 04:07:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-20 04:07:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-20 04:07:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 04:07:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-20 04:07:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-20 04:07:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-20 04:07:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:07:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 04:07:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 04:07:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:07:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 04:07:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-07-20 04:07:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-07-20 04:07:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2022-07-20 04:07:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:26,410 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-20 04:07:26,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:26,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323631091] [2022-07-20 04:07:26,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323631091] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:07:26,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072717227] [2022-07-20 04:07:26,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:26,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:07:26,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:07:26,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:07:26,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 04:07:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:27,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 3079 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-20 04:07:27,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:07:27,406 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-20 04:07:27,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:07:27,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072717227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:27,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:07:27,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [10] total 23 [2022-07-20 04:07:27,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471476408] [2022-07-20 04:07:27,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:27,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 04:07:27,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:27,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 04:07:27,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2022-07-20 04:07:27,409 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-20 04:07:28,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:28,550 INFO L93 Difference]: Finished difference Result 8541 states and 11471 transitions. [2022-07-20 04:07:28,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 04:07:28,550 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-20 04:07:28,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:28,564 INFO L225 Difference]: With dead ends: 8541 [2022-07-20 04:07:28,565 INFO L226 Difference]: Without dead ends: 4744 [2022-07-20 04:07:28,575 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-20 04:07:28,576 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-20 04:07:28,576 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-20 04:07:28,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2022-07-20 04:07:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 3810. [2022-07-20 04:07:28,854 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-20 04:07:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3810 states to 3810 states and 5081 transitions. [2022-07-20 04:07:28,862 INFO L78 Accepts]: Start accepts. Automaton has 3810 states and 5081 transitions. Word has length 325 [2022-07-20 04:07:28,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:28,863 INFO L495 AbstractCegarLoop]: Abstraction has 3810 states and 5081 transitions. [2022-07-20 04:07:28,863 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-20 04:07:28,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3810 states and 5081 transitions. [2022-07-20 04:07:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2022-07-20 04:07:28,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:28,865 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-20 04:07:28,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-20 04:07:29,079 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-20 04:07:29,080 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-20 04:07:29,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:29,080 INFO L85 PathProgramCache]: Analyzing trace with hash -445733852, now seen corresponding path program 1 times [2022-07-20 04:07:29,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:29,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079553585] [2022-07-20 04:07:29,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:29,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:07:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:07:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:07:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:07:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:07:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:07:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:07:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:07:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 04:07:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-20 04:07:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-20 04:07:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 04:07:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:07:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-20 04:07:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-20 04:07:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-20 04:07:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-20 04:07:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:07:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 04:07:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 04:07:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:07:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 04:07:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-07-20 04:07:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-20 04:07:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-20 04:07:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:29,498 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-20 04:07:29,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:29,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079553585] [2022-07-20 04:07:29,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079553585] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:29,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:07:29,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-20 04:07:29,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395928617] [2022-07-20 04:07:29,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:29,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 04:07:29,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:29,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 04:07:29,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-07-20 04:07:29,500 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-20 04:07:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:07:54,372 INFO L93 Difference]: Finished difference Result 6950 states and 9731 transitions. [2022-07-20 04:07:54,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-20 04:07:54,373 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-20 04:07:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:07:54,391 INFO L225 Difference]: With dead ends: 6950 [2022-07-20 04:07:54,392 INFO L226 Difference]: Without dead ends: 6948 [2022-07-20 04:07:54,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=872, Invalid=4678, Unknown=0, NotChecked=0, Total=5550 [2022-07-20 04:07:54,396 INFO L413 NwaCegarLoop]: 3465 mSDtfsCounter, 7274 mSDsluCounter, 14919 mSDsCounter, 0 mSdLazyCounter, 26648 mSolverCounterSat, 5347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7532 SdHoareTripleChecker+Valid, 18384 SdHoareTripleChecker+Invalid, 31995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5347 IncrementalHoareTripleChecker+Valid, 26648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:07:54,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7532 Valid, 18384 Invalid, 31995 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5347 Valid, 26648 Invalid, 0 Unknown, 0 Unchecked, 23.0s Time] [2022-07-20 04:07:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6948 states. [2022-07-20 04:07:54,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6948 to 3819. [2022-07-20 04:07:54,679 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-20 04:07:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3819 states to 3819 states and 5091 transitions. [2022-07-20 04:07:54,688 INFO L78 Accepts]: Start accepts. Automaton has 3819 states and 5091 transitions. Word has length 307 [2022-07-20 04:07:54,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:07:54,689 INFO L495 AbstractCegarLoop]: Abstraction has 3819 states and 5091 transitions. [2022-07-20 04:07:54,689 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-20 04:07:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3819 states and 5091 transitions. [2022-07-20 04:07:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-07-20 04:07:54,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:07:54,691 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-20 04:07:54,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-20 04:07:54,692 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-20 04:07:54,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:07:54,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1555187807, now seen corresponding path program 1 times [2022-07-20 04:07:54,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:07:54,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462014570] [2022-07-20 04:07:54,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:07:54,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:07:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:07:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:07:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:07:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:07:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:07:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:07:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:07:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:07:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:54,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:07:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:07:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 04:07:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-20 04:07:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-20 04:07:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 04:07:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:07:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-20 04:07:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-20 04:07:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-20 04:07:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-20 04:07:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:07:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:07:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 04:07:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 04:07:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:07:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 04:07:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:07:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-07-20 04:07:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-20 04:07:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-20 04:07:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-07-20 04:07:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:07:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:07:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:07:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 04:07:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-07-20 04:07:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-07-20 04:07:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:07:55,252 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-20 04:07:55,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:07:55,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462014570] [2022-07-20 04:07:55,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462014570] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:07:55,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:07:55,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-20 04:07:55,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130374088] [2022-07-20 04:07:55,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:07:55,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 04:07:55,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:07:55,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 04:07:55,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-07-20 04:07:55,255 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-20 04:08:14,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-20 04:08:17,586 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:08:18,946 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:08:21,305 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:08:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:08:31,954 INFO L93 Difference]: Finished difference Result 8522 states and 12102 transitions. [2022-07-20 04:08:31,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-07-20 04:08:31,954 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-20 04:08:31,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:08:31,982 INFO L225 Difference]: With dead ends: 8522 [2022-07-20 04:08:31,982 INFO L226 Difference]: Without dead ends: 8520 [2022-07-20 04:08:31,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2309 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=976, Invalid=6856, Unknown=0, NotChecked=0, Total=7832 [2022-07-20 04:08:31,988 INFO L413 NwaCegarLoop]: 3752 mSDtfsCounter, 8227 mSDsluCounter, 22640 mSDsCounter, 0 mSdLazyCounter, 35785 mSolverCounterSat, 6669 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8469 SdHoareTripleChecker+Valid, 26392 SdHoareTripleChecker+Invalid, 42455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6669 IncrementalHoareTripleChecker+Valid, 35785 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:08:31,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8469 Valid, 26392 Invalid, 42455 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6669 Valid, 35785 Invalid, 1 Unknown, 0 Unchecked, 34.0s Time] [2022-07-20 04:08:31,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8520 states. [2022-07-20 04:08:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8520 to 3949. [2022-07-20 04:08:32,432 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-20 04:08:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 5276 transitions. [2022-07-20 04:08:32,443 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 5276 transitions. Word has length 353 [2022-07-20 04:08:32,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:08:32,444 INFO L495 AbstractCegarLoop]: Abstraction has 3949 states and 5276 transitions. [2022-07-20 04:08:32,444 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-20 04:08:32,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 5276 transitions. [2022-07-20 04:08:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2022-07-20 04:08:32,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:08:32,448 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-20 04:08:32,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-20 04:08:32,448 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-20 04:08:32,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:08:32,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1868564358, now seen corresponding path program 1 times [2022-07-20 04:08:32,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:08:32,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982299090] [2022-07-20 04:08:32,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:08:32,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:08:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:08:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:08:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:08:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:08:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:08:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:08:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:08:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:08:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:08:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:08:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 04:08:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-20 04:08:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-20 04:08:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 04:08:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:08:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-20 04:08:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-20 04:08:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-20 04:08:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-20 04:08:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:08:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 04:08:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 04:08:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:08:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 04:08:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:08:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-07-20 04:08:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-20 04:08:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-20 04:08:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-07-20 04:08:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-07-20 04:08:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2022-07-20 04:08:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-07-20 04:08:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-20 04:08:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:08:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:08:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:08:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2022-07-20 04:08:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-20 04:08:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-07-20 04:08:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2022-07-20 04:08:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-07-20 04:08:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:08:32,829 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-20 04:08:32,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:08:32,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982299090] [2022-07-20 04:08:32,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982299090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:08:32,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:08:32,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 04:08:32,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291977167] [2022-07-20 04:08:32,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:08:32,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 04:08:32,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:08:32,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 04:08:32,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:08:32,831 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)